Back to Search
Start Over
Faster NTRU on ARM Cortex-M4 With TMVP-Based Multiplication.
- Source :
-
IEEE Transactions on Circuits & Systems. Part I: Regular Papers . Oct2022, Vol. 69 Issue 10, p4083-4092. 10p. - Publication Year :
- 2022
-
Abstract
- This paper focuses on speeding up NTRU - one of the lattice-based finalists of the NIST PQC competition - by improving the ring multiplication. The Number Theoretic Transform (NTT), Toom-Cook, and Karatsuba are the most commonly used algorithms for implementing NTRU. In this paper, we propose Toeplitz matrix-vector product (TMVP) based algorithms for multiplication for all parameter sets of NTRU. We implement the proposed algorithms on ARM Cortex-M4. The results show that the TMVP-based multiplication algorithms we propose are more efficient than the others in the literature in most cases. Our algorithm for ntruhps2048509 outperform the Toom-Cook and NTT methods in the literature by 25.4% and 21.5%. We also observe the impact of these improvements on the overall performance of NTRU. We speed up the key generation, encryption, decryption, encapsulation, and decapsulation algorithms of ntruhps2048509 by 12.5%, 14.3%, 17.7%, 3.9%, and 14.7%, respectively, compared to state-of-the-art implementation. Moreover, our algorithms require less stack space than the others. [ABSTRACT FROM AUTHOR]
- Subjects :
- *MULTIPLICATION
*QUANTUM computing
Subjects
Details
- Language :
- English
- ISSN :
- 15498328
- Volume :
- 69
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Circuits & Systems. Part I: Regular Papers
- Publication Type :
- Periodical
- Accession number :
- 160688642
- Full Text :
- https://doi.org/10.1109/TCSI.2022.3191111