Improved Polynomial Multiplication Algorithms over Characteristic Three Fields and Applications to NTRU Prime

Yeniaras, Esra
Cenk, Murat
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 faster than Bernstein’s 3-way method in terms of implementation speed. We observe that, compared to the most recent methods, for the input size 1280, the new 4-way method together with the unbalanced 5-way split one provide a 48.6 % decrease in arithmetic complexity for polynomial multiplication over F9 and a 26.8 % decrease for polynomial multiplication over F3 respectively. Moreover, from the implementation perspective, the unbalanced 5-way algorithm yields faster polynomial multiplication results. For application purposes, we pick the quantum-resistant key encapsulation protocol NTRU Prime, proposed by Bernstein et al., since it executes a characteristic three polynomial multiplication in the decapsulation stage. Implementing the proposed algorithms combining with the other known methods in C, on an Intel (R) Core (TM) i7-10510U architecture, we observe a 29.85 % speedup for sntrup653 and a 35.52 % speedup for sntrup761.
14th International Conference on Innovative Security Solutions for Information Technology and Communications, SecITC 2021


Yeniaras, Esra; Cenk, Murat; Department of Cryptography (2022-1-21)
Some of the post-quantum cryptographic protocols require polynomial multiplication in characteristic three fields, thus the efficiency of such multiplication algorithms gain more importance recently. In this thesis, we propose four new polynomial multiplication algorithms in characteristic three fields and we show that they are more efficient than the current state-of-the-art methods. We first analyze the well-known algorithms such as the schoolbook method, Karatsuba 2-way and 3-way split methods, Bernstein...
Faster characteristic three polynomial multiplication and its application to NTRU Prime decapsulation
Yeniaras, Esra; Cenk, Murat (2022-01-01)
Efficient computation of polynomial multiplication over characteristic three fields is required for post-quantum cryptographic applications which gain importance upon the recent advances in quantum computers. In this paper, we propose three new polynomial multiplication algorithms over F-3 and show that they are more efficient than the current state-of-the-art algorithms. We first examine through the well-known multiplication algorithms in F-3[x] including the Karatsuba 2-way and 3-way split formulas along ...
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...
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...
Improving the big bang-big crunch algorithm for optimum design of steel frames
Hasançebi, Oğuzhan (null; 2012-01-01)
This paper presents an improved version of the big bang-big crunch (BB-BC) algorithm namely exponential BB-BC algorithm (EBB-BC) for optimum design of steel frames according to ASD-AISC provisions. It is shown that the standard version of the algorithm sometimes is unable to provide reasonable solutions for problems from discrete design optimization of steel frames. Therefore, by investigating the shortcomings of the BB-BC algorithm, it is aimed to enhance the algorithm for solving complicated steel frame o...
Citation Formats
E. Yeniaras and M. Cenk, “Improved Polynomial Multiplication Algorithms over Characteristic Three Fields and Applications to NTRU Prime,” Virtual, Online, 2022, vol. 13195 LNCS, Accessed: 00, 2023. [Online]. Available: