Elliptic curve cryptography point multiplication core for hardware security module

MA Mehrabi, C Doche, A Jolfaei - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
In today's technology, a sheer number of Internet of Things applications use hardware
security modules for secure communications. The widely used algorithms in security …

Hybrid binary-ternary number system for elliptic curve cryptosystems

J Adikari, VS Dimitrov, L Imbert - IEEE transactions on …, 2010 - ieeexplore.ieee.org
Single and double scalar multiplications are the most computational intensive operations in
elliptic curve based cryptosystems. Improving the performance of these operations is …

Double-base scalar multiplication revisited

DJ Bernstein, C Chuengsatiansup, T Lange - 2017 - research.tue.nl
This paper reduces the number of field multiplications required for scalar multiplication on
conservative elliptic curves. For an average 256-bit integer n, this paper's multiply-by-n …

New multibase non-adjacent form scalar multiplication and its application to elliptic curve cryptosystems (extended version)

P Longa, A Miri - Cryptology ePrint Archive, 2008 - eprint.iacr.org
In this paper we present a new method for scalar multiplication that uses a generic multibase
representation to reduce the number of required operations. Further, a multibase NAF-like …

Conversion algorithms and implementations for Koblitz curve cryptography

BB Brumley, KU Jarvinen - IEEE Transactions on computers, 2009 - ieeexplore.ieee.org
In this paper, we discuss conversions between integers and tau-adic expansions and we
provide efficient algorithms and hardware architectures for these conversions. The results …

Area-efficient multipliers based on multiple-radix representations

VS Dimitrov, KU Jarvinen… - IEEE Transactions on …, 2010 - ieeexplore.ieee.org
In this paper, we shall introduce several new algorithms for integer multiplication that are
based on specific multiple-radix representation of one of the multiplicands. We provide …

A Fast Hardware Architecture for Integer to\tauNAF Conversion for Koblitz Curves

J Adikari, VS Dimitrov… - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
Scalar multiplication in elliptic curve cryptography is the most computational intensive
operation. Efficiency of this operation can be significantly improved in hardware …

Double-base chains for scalar multiplications on elliptic curves

W Yu, SA Musa, B Li - Annual International Conference on the Theory and …, 2020 - Springer
Double-base chains (DBCs) are widely used to speed up scalar multiplications on elliptic
curves. We present three results of DBCs. First, we display a structure of the set containing …

Error Detection Schemes for τ NAF Conversion within Koblitz Curves Benchmarked on Various ARM Processors

K Ahmadi, S Aghapour, MM Kermani… - Authorea …, 2023 - techrxiv.org
Elliptic curves cryptography, the most widely-deployed pre-quantum public key
cryptography, can be implemented efficiently with Koblitz curves. The reason for these …

Montgomery algorithm over a prime field

W Yu, K Wang, B Li, S Tian - Chinese Journal of Electronics, 2019 - Wiley Online Library
New formulae for point addition and point doubling on elliptic curves over prime fields are
presented. Based on these formulae, an improved Montgomery algorithm is proposed. The …