Efficient NTT Multiplier of NTRU Prime PQC Algorithm

Salarifard, Raziyeh; Rashidian, Reza; Kharazmi, Reyhaneh; Jahanian, Ali

doi:10.48308/jicse.2023.103638

Efficient NTT Multiplier of NTRU Prime PQC Algorithm

Document Type : Original Article

Authors

Raziyeh Salarifard ¹

Reza Rashidian ²

Reyhaneh Kharazmi ²

Ali Jahanian ³

¹ Faculty of Computer Science and Engineering , Shahid Beheshti University

² Faculty of Computer Science and Engineering, Shahid Beheshti University

³ گروہ معماری کامپیوتر دانشکدہ مہندسی و علوم کامپیوتر دانشگاہ شہید بہشتی

https://doi.org/10.48308/jicse.2023.103638

Abstract

As quantum computers become increasingly powerful, the threat of attacking classical algorithms will become more significant. Hence, post-quantum cryptography algorithms are effective alternatives to previous asymmetric algorithms. NTRU Prime is one of the KEM algorithms based on the attention grid in the NIST competition. Implementing such algorithms involves heavy polynomial multiplications over a ring. Number theoretic transformations allow the multiplication of polynomials to be performed in quasi-linear time O(nlog(n)). Hardware implementations of NTT multipliers are typically implemented using a butterfly structure to increase efficiency. We have proposed an efficient architecture for the NTT multiplier. We have redesigned and modified the method for using and storing the pre-processed data, this idea results in a 7% increase in frequency and a reduction of over 14% in the use of LUTs, compared to the best previous work. As a result of the reduction in delay, as well as the reduction in resources consumed, the efficiency of the process has been increased.

Keywords

Post-quantum cryptography

Number Theoretic Transform

Polynomial multiplication over a ring

NTRU Prime

Subjects