On the generalisation of special moduli for faster interleaved montgomery modular multiplication

Date

2013-09-01

Author

AKLEYLEK, SEDAT
Cenk, Murat
Özbudak, Ferruh

Metadata

Show full item record

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

Item Usage Stats

184
views

0
downloads

In this study, the authors give a generalisation of special moduli for faster interleaved Montgomery modular multiplication algorithm with simplified pre-computational phase for GF(p(n)), where p 2 is a prime number and n is a positive integer. The authors propose different sets of moduli that can be used in elliptic curve crytographic applications and pairing-based cryptography. Moreover, this method also leads to efficient implementations for the elliptic curve parameters given in standards. It is shown 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. The authors eliminate final substraction step with proposed sets of moduli. These methods are easy to implement for hardware.

Subject Keywords

XOR gates, AND gates, Elliptic curve parameters, Pairing-based cryptography, Elliptic curve crytographic applications, Positive integer, Prime number, Simplified precomputational phase, Faster interleaved Montgomery modular multiplication algorithm, Moduli generalisation, Public key cryptography, Multiplying circuits, Logic gates

URI

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

Journal

IET INFORMATION SECURITY

DOI

https://doi.org/10.1049/iet-ifs.2010.0271

Collections

Graduate School of Applied Mathematics, Article

Suggestions

OpenMETU
Core

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...
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...
A generic identification theorem for L*-groups of finite Morley rank Berkman, Ayse; Borovik, Alexandre V.; Burdges, Jeffrey; Cherfin, Gregory (Elsevier BV, 2008-01-01) This paper provides a method for identifying "sufficiently rich" simple groups of finite Morley rank with simple algebraic groups over algebraically closed fields. Special attention is given to the even type case, and the paper contains a number of structural results about simple groups of finite Morley rank and even type.
On the arithmetic operations over finite fields of characteristic three with low complexity AKLEYLEK, SEDAT; Özbudak, Ferruh; Özel, Claire Susanna (2014-03-15) In this paper, the Hermite polynomial representation is adapted as a new way to represent certain finite fields of characteristic three. We give the multiplication method to multiply two elements of F-3n in the Hermite polynomial representation with subquadratic computational complexity by using a divide-and-conquer idea. We show that in some cases there is a set of irreducible binomials in the Hermite polynomial representation to obtain modular reduction with a lower addition complexity than the standard p...

Citation Formats

S. AKLEYLEK, M. Cenk, and F. Özbudak, “On the generalisation of special moduli for faster interleaved montgomery modular multiplication,” IET INFORMATION SECURITY, pp. 165–171, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/30844.