|
FPGA Implementation of Polynomial Multiplication in NTRU Prime PQC Algorithms
|
Reza Rashidian   , Raziyeh Salarifard * , Ali Jahanian |
| Faculty of Computer Science and Engineering, Shahid Beheshti University, Tehran, Iran |
|
|
Abstract: (1371 Views) |
The adoption of post-quantum encryption algorithms to replace older asymmetric algorithms is of paramount importance. Diverse categories of post-quantum encryption, including lattice-based and code-based cryptography, are currently in the final stages of NIST's standardization competition, with the aim of providing security against quantum computers. Among the lattice-based key encapsulation mechanisms (KEM) garnering attention in this competition, the NTRU Prime algorithm stands out. The primary challenge in implementing such algorithms revolves around executing resource-intensive polynomial multiplications within a ring structure. Leveraging the Number Theoretic Transform (NTT) allows us to achieve polynomial multiplication with near-linear efficiency (O (n log n)). To enhance hardware efficiency, butterfly structures are frequently employed in NTT multipliers. Our research centers on comparing our approach with the best multiplication implementations utilized in NTRU Prime on FPGA up to the present version. This involves the redesign and modification of data preprocessing methods and storage structures, resulting in an increase in frequency and a reduction in the utilization of LUT resources.
|
|
| Keywords: Post Qountom Cryptography, Latticed-based Cryptography, NTRU Prime, Polynomial Multiplication |
|
|
Full-Text [PDF 1499 kb]
(681 Downloads)
|
Type of Study: Research Article |
Subject:
Special
Received: 2023/10/21 | Accepted: 2024/02/29 | Published: 2024/02/29
|
|
|
|
|
|
|
| Send email to the article author |
|
|
|
| Add your comments about this article |
|
|
|
