FPGA Acceleration of Number Theoretic Transform

Tian, Ye; Yang, Yang; Kuppannagari, Sanmukh R.; Kannan, Rajgopal; Prasanna, Viktor K.

doi:10.1007/978-3-030-78713-4_6

Cited by 4 publications

(1 citation statement)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our previous work [4] uses a similar approach for NTT and INTT, with a tweaked modular algorithm for Kyber's prime called Exact KRED and a 2x2 butterfly unit configuration and low-complexity NTT and INTT algorithm. Ye et al [5] improves upon the work of Zhang et al, hard coded the modular reduction algorithm to NEWHOPE prime q. They also introduce a fully pipelined structure between stages of NTT and compute with NTT cores.…”

Section: Introductionmentioning

confidence: 99%

Efficient number theoretic transform accelerator for CRYSTALS-Kyber

Nguyen,

Anh Pham,

Nguyen

et al. 2024

IJEECS

View full text Add to dashboard Cite

<p>The national institute of standards and technology (NIST) has presented its draft of the module-lattice-based key-encapsulation mechanism standard (MLBKEMS), choosing cryptographic suite for algebraic lattices (CRYSTALS)- Kyber as the base encryption. Existing hardware implementations of modern cryptography will need to process the new standard efficiently. The primary process in CRYSTALS-Kyber key-encapsulation mechanism (KEM) is the number theoretic transform (NTT), which requires heavy computing power. This paper contributes an efficient hardware accelerator for NTT and inverse NTT (INTT) by CRYSTAL-Kyber parameters. The proposed design utilizes the K-RED algorithm for reducing polynomial multiplication. It also incorporates the BrentKung method for efficient modular addition and subtraction operation with an address generator to control the sequences of computation. On the Xilinx Artix 7 field programmable gate array (FPGA), our design achieves 262 MHz clock speed, utilizing only 1405 LUTs.</p>

show abstract

Section: Introductionmentioning

confidence: 99%