Paper 2026/1420
An Optimized Native Rust Implementation of the KpqC Algorithms
Abstract
This paper presents a native Rust implementation of the Korean post-quantum cryptography algorithms (i.e., NTRU+, SMAUG-T, HAETAE, AIMer). We optimize the implementation in Rust for speed and memory usage, and compare our implementation with the C reference code (KpqClean) and unoptimized Rust implementation (baseline). For speed, we use AVX2 and PCLMULQDQ to accelerate NTT- and Toom–Cook-based polynomial multiplication, 4-way SHAKE, and carry-less GF(2^λ) multiplication. Compared to the C reference, the speed-optimized version reduces the execution time by 32–76% across all target schemes. For memory, we reduce large temporary buffers through on-the-fly approach, two-pass sampling, and transcript recomputation. Against the C reference, the memory-optimized implementation reduces the total memory usage by 1–94% across all target schemes. Overall, these results show a speed–memory trade-off, letting an implementation be chosen according to whichever resource is more constrained.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint.
- Keywords
- Post-quantum cryptographyKpqCRust ImplementationMemory safetySIMD accelerationMemory optimization
- Contact author(s)
-
yulim4hyoung @ gmail com
rhcp030418 @ gmail com
khj1594012 @ gmail com
hwajeong84 @ gmail com - History
- 2026-07-16: approved
- 2026-07-11: received
- See all versions
- Short URL
- https://ia.cr/2026/1420
- License
-
CC0
BibTeX
@misc{cryptoeprint:2026/1420,
author = {Yu-Lim Hyoung and Do-Yun Park and Hyun-Ji Kim and Hwa-Jeong Seo},
title = {An Optimized Native Rust Implementation of the {KpqC} Algorithms},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1420},
year = {2026},
url = {https://eprint.iacr.org/2026/1420}
}
