Compact and Low-Latency FPGA-Based Number Theoretic Transform Architecture for CRYSTALS Kyber Postquantum Cryptography Scheme
-
Published:2024-07-11
Issue:7
Volume:15
Page:400
-
ISSN:2078-2489
-
Container-title:Information
-
language:en
-
Short-container-title:Information
Author:
Kieu-Do-Nguyen Binh123ORCID, The Binh Nguyen12ORCID, Pham-Quoc Cuong12ORCID, Nghi Huynh Phuc12ORCID, Tran Ngoc-Thinh12ORCID, Hoang Trong-Thuc3ORCID, Pham Cong-Kha3ORCID
Affiliation:
1. Faculty of Computer Science and Engineering, Ho Chi Minh City University of Technology (HCMUT), 268 Ly Thuong Kiet St., Dist. 10, Ho Chi Minh City 740050, Vietnam 2. Computer Engineering Department, Vietnam National University—Ho Chi Minh City (VNU-HCM), Thu Duc, Ho Chi Minh City 700000, Vietnam 3. Department of Computer and Network Engineering, University of Electro-Communications (UEC), Tokyo 182-8585, Japan
Abstract
In the modern era of the Internet of Things (IoT), especially with the rapid development of quantum computers, the implementation of postquantum cryptography algorithms in numerous terminals allows them to defend against potential future quantum attack threats. Lattice-based cryptography can withstand quantum computing attacks, making it a viable substitute for the currently prevalent classical public-key cryptography technique. However, the algorithm’s significant time complexity places a substantial computational burden on the already resource-limited chip in the IoT terminal. In lattice-based cryptography algorithms, the polynomial multiplication on the finite field is well known as the most time-consuming process. Therefore, investigations into efficient methods for calculating polynomial multiplication are essential for adopting these quantum-resistant lattice-based algorithms on a low-profile IoT terminal. Number theoretic transform (NTT), a variant of fast Fourier transform (FFT), is a technique widely employed to accelerate polynomial multiplication on the finite field to achieve a subquadratic time complexity. This study presents an efficient FPGA-based implementation of number theoretic transform for the CRYSTAL Kyber, a lattice-based public-key cryptography algorithm. Our hybrid design, which supports both forward and inverse NTT, is able run at high frequencies up to 417 MHz on a low-profile Artix7-XC7A100T and achieve a low latency of 1.10μs while achieving state-of-the-art hardware efficiency, consuming only 541-LUTs, 680 FFs, and four 18 Kb BRAMs. This is made possible thanks to the newly proposed multilevel pipeline butterfly unit architecture in combination with employing an effective coefficient accessing pattern.
Funder
Vietnam National University Ho Chi Minh City
Reference30 articles.
1. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer;Shor;SIAM J. Sci. Statist. Comput.,1997 2. Grover, L.K. (1996, January 22–24). A Fast Quantum Mechanical Algorithm for Database Search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA. 3. A Method for Obtaining Digital Signatures and Public-key Cryptosystems;Rivest;Commun. ACM,1978 4. Miller, V.S. (1985, January 18–22). Use of Elliptic Curves in Cryptography. Proceedings of the Advances in Cryptology (CRYPTO), Santa Barbara, CA, USA. 5. Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J.M., Schwabe, P., Seiler, G., and Stehle, D.D. (2018, January 24–26). CRYSTALS—Kyber: A CCA-Secure Module-Lattice-Based KEM. In Proceedings of the European Symposium on Security and Privacy (EuroS&P), London, UK.
|
|