Integer Decomposition for Fast Scalar Multiplication on Elliptic Curves
Since Miller and Koblitz applied elliptic curves to cryptographic system in 1985 ,, a lot of researchers have been interested in this field and various speedup techniques for the scalar multiplication have been developed. Recently, Gallant et al. published a method that accelerates the scalar multiplication and is applicable to a larger class of curves . In the process of their method, they assumed the existence of a special pair of two short linearly independent vectors. Once a pair of such vectors exists, their decomposition method improves the efficiency of the scalar multiplication roughly about 50%. In this paper, we state and prove a necessary condition for the existence of a pair of desired vectors and we also present an algorithm to find them.
Keywordselliptic curve cryptosystem scalar multiplication integer decomposition endomorphism
- 3.V. Miller: ‘Use of Elliptic Curves in Cryptography’, Advances in Cryptology-Crypto’85, Lecture Notes in Computer Science, Vol 263, 1986, pp.417–426.Google Scholar
- 4.R. Gallant, R. Lambert, and L. Vanstone: ‘Faster Point Multiplication on Elliptic Curves with Efficient Endomorphism’, Advances in Cryptology-Crypto’2001, Lecture Notes in Computer Science, Vol 2139, 2001, pp.190–201.Google Scholar
- 7.C. Lim and P. Lee: ‘More Flexible Exponentiation with Precomputation’, Advances in Cryptology-Crypto’94, Lecture Notes in Computer Science, Vol 839, 1994, pp.95–107.Google Scholar