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

2022-07-01
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.
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS

Suggestions

Speeding up Curve25519 using Toeplitz Matrix-vector Multiplication
Taskin, Halil Kemal; Cenk, Murat (2018-01-24)
This paper proposes a new multiplication algorithm over F-2(255)-19 where the de-facto standard Curve25519 [2] algorithm is based on. Our algorithm for the underlying finite field multiplication exploits the Toeplitz matrix-vector multiplication and achieves salient results. We have used a new radix representation that is infeasible when used with schoolbook multiplication techniques but has notable advantages when used with Toeplitz matrix-vector multiplication methods. We present the new algorithm and dis...
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 ...
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...
Extension of Forward Backward Method with DFT Based Acceleration Algorithm for The Efficient Analysis of Radiation Scattering from Large Finite Printed Dipole Arrays
Aydın Çivi, Hatice Özlem (Wiley, 2003-04-01)
A discrete‐Fourier‐transform (DFT) based forward‐backward (FB) algorithm has been developed for the fast and accurate analysis of electrically large freestanding dipole arrays [1]. In this paper, an extension of the FB method (FBM) with a DFT‐based acceleration approach is presented to provide a relatively efficient analysis of EM radiation/scattering from an electrically large, planar, periodic, finite dipole array printed on a grounded dielectric substrate. Computational complexity of this new approach 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.