Paper 2022/300 Original: eprint.iacr.org/2022/300 ↗
Faster NTRU on ARM Cortex-M4 with TMVP-based multiplication
Abstract
The Number Theoretic Transform (NTT), Toom-Cook, and Karatsuba are the most commonly used algorithms for implementing lattice-based ?nalists of the NIST PQC competition. In this paper, we propose Toeplitz matrix-vector product (TMVP) based algorithms for multiplication for all parameter sets of NTRU. We implement the pro- posed algorithms on ARM Cortex-M4. The results show that TMVP- based multiplication algorithms using the four-way TMVP formula are more e?cient for NTRU. Our algorithms outperform the Toom-Cook method by up to 25.3%, and the NTT method by up to 19.8%. More- over, our algorithms require less stack space than the others in most cases. We also observe the impact of these improvements on the overall performance of NTRU. We speed up the encryption, decryption, en- capsulation, and decapsulation by up to 13.7%,17.5%,3.5%, and 14.1%, respectively, compared to state-of-the-art implementation.
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2022-03-07: last updated
- 2022-03-07: published
- Short URL
- https://ia.cr/2022/300
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2022/300,
author = {Irem Keskinkurt Paksoy and Murat Cenk},
title = {Faster NTRU on ARM Cortex-M4 with TMVP-based multiplication},
howpublished = {Cryptology {ePrint} Archive, Paper 2022/300},
year = {2022},
url = {https://eprint.iacr.org/2022/300}
}