Algorithms for Efficient Simultaneous Elliptic Scalar Multiplication with Reduced Joint Hamming Weight Representation of Scalars
The computational performance of cryptographic protocols using an elliptic curve strongly depends on the efficiency of the scalar multiplication. Some elliptic curve based cryptographic protocols, such as signature verification, require computation of multi scalar multiplications of kP + lQ, where P and Q are points on an elliptic curve. An efficient way to compute kP + lQ is to compute two scalar multiplications simultaneously, rather than computing each scalar multiplication separately. We introduce new efficient algorithms for simultaneous scalar multiplication on an elliptic curve. We also give a detailed analysis of the computational efficiency of our proposed algorithms.
KeywordsElliptic Curve Cryptosystems Scalar Multiplication
Unable to display preview. Download preview PDF.
- [LL94]C.H. Lim, P.J. Lee, “More Flexible Exponentiation with Precomputation,” Advances in Cryptology-CRYPTO’94, LNCS, 839 (1994), Springer-Verlag, 95–107.Google Scholar
- [Mi85]V. Miller, “Uses of elliptic curves in cryptography,” Advances in Cryptology-CRYPTO’85, LNCS, 218 (1986), Springer-Verlag, 417–426.Google Scholar
- [MOV97]A.J. Menezes, P.C. Oorschot, S.A. Vanstone, “Handbook of Applied Cryptography,” CRC Press, Inc, (1999)Google Scholar
- [So01]J.A. Solinas, “Some Computational Speedups and Bandwidth Improvements for Curves over Prime Fields,” available at http://www.cacr.math.uwaterloo.ca/conferences/2001/ecc/slides.html, (2001)