학술논문

High-Speed NTT-based Polynomial Multiplication Accelerator for Post-Quantum Cryptography
Document Type
Conference
Source
2021 IEEE 28th Symposium on Computer Arithmetic (ARITH) ARITH Computer Arithmetic (ARITH), 2021 IEEE 28th Symposium on. :94-101 Jun, 2021
Subject
Components, Circuits, Devices and Systems
Computing and Processing
Memory management
Transforms
Standardization
NIST
Public key cryptography
Table lookup
Cryptography
FPGA
hardware architecture
Kyber
lattice-based cryptography
NTT
post-quantum cryptography
Language
ISSN
2576-2265
Abstract
This paper demonstrates an architecture for accelerating the polynomial multiplication using number theoretic transform (NTT). Kyber is one of the finalists in the third round of the NIST post-quantum cryptography standardization process. Simultaneously, the performance of NTT execution is its main challenge, requiring large memory and complex memory access pattern. In this paper, an efficient NTT architecture is presented to improve the respective computation time. We propose several optimization strategies for efficiency improvement targeting different performance requirements for various applications. Our NTT architecture, including four butterfly cores, occupies only 798 LUTs and 715 FFs on a small Artix-7 FPGA, showing more than 44% improvement compared to the best previous work. We also implement a coprocessor architecture for Kyber KEM benefiting from our high-speed NTT core to accomplish three phases of the key exchange in 9, 12, and $\mathbf{19}\mu \mathbf{s}$, respectively, operating at 200 MHz.