Faster NTRU on ARM Cortex-M4 With TMVP-Based Multiplication

Date

2022-07-01

Author

Keskinkurt Paksoy, İrem
Cenk, Murat

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

206
views

0
downloads

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.

Subject Keywords

Arithmetic, Complexity theory, NIST, Quantum computing, Encryption, Transforms, Standardization, Lattice-based, post-quantum, ARM Cortex-M4, NTRU, Toeplitz, TMVP, COMPLEXITY, COMPUTATION, MULTIPLIERS

URI

https://hdl.handle.net/11511/99090

Journal

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS

DOI

https://doi.org/10.1109/tcsi.2022.3191111

Collections

Graduate School of Applied Mathematics, Article

Suggestions

OpenMETU
Core

High speed VLSI implementation of the Rijndael Encryption Algorithm Sever, Refik; Aşkar, Murat; Department of Electrical and Electronics Engineering (2003) This thesis study presents a high speed VLSI implementation of the Rijndael Encryption Algorithm, which is selected to be the new Advanced Encryption Standard (AES) Algorithm. Both the encryption and the decryption algorithms of Rijndael are implemented as a single ASIC. Although data size is fixed to 128 bits in the AES, our implementation supports all the data sizes of the original Rijndael Algorithm. The core is optimised for both area and speed. Using 149K gates in a 0.35-æm standard CMOS process, 132 M...
Different diode configurations evaluation in photovoltaic arrays using binary coding method Ziar, H.; Afjei, E.; Siadatan, A.; Arjhangmehr, A. (2011-09-10) This paper used a robust mathematical way (binary coding method) to study shadow effect in photovoltaic arrays. Binary coding method provides a way to define power generation index (PGI) as a factor which shows the performance of arrays at shadow condition. Different configurations of photovoltaic (PV) array show different behavior at shadow condition. Configurations behavior depends on modules interconnections, bypass and blocking diodes, and etc. Configuration which has better working condition should be ...
Improved Polynomial Multiplication Algorithms over Characteristic Three Fields and Applications to NTRU Prime Yeniaras, Esra; Cenk, Murat (2022-01-01) This paper introduces a new polynomial multiplication algorithm which decreases the arithmetic complexity and another modified algorithm that speeds up the implementation run-time over the characteristic three fields. We first introduce a new polynomial multiplication algorithm using a 4-way split approach and observe that its asymptotic arithmetic complexity is better than Bernstein’s 3-way method for characteristic three fields. We then define an unbalanced split version a 5-way split method which is fast...
Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields Akleylek, Sedat; Cenk, Murat; Özbudak, Ferruh (2010-09-24) In this paper, we give faster versions of Montgomery modular multiplication algorithm without pre-computational phase for GF(p) and GF(2 m ) which can be considered as a generalization of [3], [4] and [5]. We propose sets of moduli different than [3], [4] and [5] which can be used in PKC applications. We show that one can obtain efficient Montgomery modular multiplication architecture in view of the number of AND gates and XOR gates by choosing proposed sets of moduli. We eliminate precomputational phase wi...
New generation chiral metamaterials based on omega resonators with small and smooth chirality over a certain frequency band Dincer, Furkan; AKGÖL, OĞUZHAN; Karaaslan, Muharrrem; ÜNAL, EMİN; Demirel, Ekrem; Sabah, Cumali (World Scientific Pub Co Pte Lt, 2016-02-20) In this paper, we have designed, simulated and analyzed a new generation chiral metamaterials (MTMs) with two geometries. There are various types of chiral MTM structures in the literature and almost all of them are indented to be designed for high level of chirality. In fact, small chirality and its application areas were mostly ignored by researchers. In this sense, our study is one of the pioneer works for this type of research. Each structure based on omega resonators (ORs) with small chirality value is...

Citation Formats

İ. Keskinkurt Paksoy and M. Cenk, “Faster NTRU on ARM Cortex-M4 With TMVP-Based Multiplication,” IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, pp. 0–0, 2022, Accessed: 00, 2022. [Online]. Available: https://hdl.handle.net/11511/99090.