TY - GEN
T1 - Scalable and High-Performance Number-Theoretic Transform Design for Lattice-Based Cryptography
AU - Nguyen, Hien
AU - Truong, Quang Dang
AU - Lee, Hanho
AU - Nguyen, Tuy Tan
N1 - Publisher Copyright:
© 2025 IEEE.
PY - 2025
Y1 - 2025
N2 - Efficient polynomial multiplication is a key operation in post-quantum cryptography (PQC) and homomorphic encryption (HE), particularly in lattice-based schemes where the number-theoretic transform (NTT) is the main contributor to computational cost. To address performance and efficiency challenges in these applications, this paper presents a scalable and high-performance NTT architecture tailored for practical deployments of PQC schemes and HE workloads. The proposed architecture features a mix of radix-2/4 fully pipelined datapath, a stage-aware modular reduction strategy combining K2RED and Montgomery methods, and a compressed twiddle factor storage that leverages symmetry and data access patterns. These innovations collectively enable high-performance NTT computation with minimized hardware costs. Synthesized on Xilinx UltraScale+ FPGA, the design achieves 3.71 KLUTs × ms for N=214, outperforming its predecessors. This architecture presents a compelling solution for FPGA-based cryptographic accelerators, delivering scalable performance across various transform sizes while adhering to practical deployment constraints.
AB - Efficient polynomial multiplication is a key operation in post-quantum cryptography (PQC) and homomorphic encryption (HE), particularly in lattice-based schemes where the number-theoretic transform (NTT) is the main contributor to computational cost. To address performance and efficiency challenges in these applications, this paper presents a scalable and high-performance NTT architecture tailored for practical deployments of PQC schemes and HE workloads. The proposed architecture features a mix of radix-2/4 fully pipelined datapath, a stage-aware modular reduction strategy combining K2RED and Montgomery methods, and a compressed twiddle factor storage that leverages symmetry and data access patterns. These innovations collectively enable high-performance NTT computation with minimized hardware costs. Synthesized on Xilinx UltraScale+ FPGA, the design achieves 3.71 KLUTs × ms for N=214, outperforming its predecessors. This architecture presents a compelling solution for FPGA-based cryptographic accelerators, delivering scalable performance across various transform sizes while adhering to practical deployment constraints.
KW - homomorphic encryption
KW - Number-theoretic transform
KW - post-quantum cryptography
UR - https://www.scopus.com/pages/publications/105035395073
UR - https://www.scopus.com/pages/publications/105035395073#tab=citedBy
U2 - 10.1109/APCCAS67402.2025.11377485
DO - 10.1109/APCCAS67402.2025.11377485
M3 - Conference contribution
AN - SCOPUS:105035395073
T3 - Proceedings - 2025 21st IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2025
BT - Proceedings - 2025 21st IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2025
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2025 21st IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2025
Y2 - 12 October 2025 through 15 October 2025
ER -