This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Addition Formula for Elliptic Curves over GF(2^n)
August 2002 (vol. 51 no. 8)
pp. 972-975

In this paper, we propose a new addition formula in projective coordinates for elliptic curves over GF(2^n). The new formula speeds up the elliptic curve scalar multiplication by reducing the number of field multiplications. This was achieved by rewriting the elliptic curve addition formula. The complexity analysis shows that the new addition formula speeds up the addition in projective coordinates by about 10-2 percent, which leads to enhanced scalar multiplication methods for random and Koblitz curves.

[1] http:/www.certicom.com, Jan. 2001.
[2] N. Smart, I.F. Blake, and G. Seroussi, Elliptic Curves in Cryptography, Cambridge Univ. Press, Cambridge, UK, 1999.
[3] J. López and R. Dahab, “Fast Multiplication on Elliptic Curves over$\big. {\rm GF(2^n)}\bigr.$without Precomputation,” Proc. Cryptographic Hardware and Embedded Systems—CHES '99, pp. 316-327, 1999.
[4] IEEE P1363, “Standard Specifications for Public Key Cryptography,” Draft 9, June 2001. http://grouper.ieee.org/groups1363/.
[5] J. López and R. Dahab, “Improved Algorithms for Elliptic Curve Arithmetic in$\big. GF(2^n)\bigr.$,” Proc. Selected Areas in Cryptography—SAC '98, pp. 201-212, 1998.
[6] D. Hankerson, J.L. Hernandez, and A. Menezes, “Software Implementation of Elliptic Curve Cryptography over Binary Fields,” Proc. Cryptographic Hardware and Embedded Systems—CHES 2000, pp. 1-24, 2000.
[7] J. Solinas, “Efficient Arithmetic on Koblitz Curves,” Designs, Code, and Cryptography, vol. 19, pp. 195-249, 2000.
[8] E. Knudsen, “Elliptic Scalar Multiplication Using Point Halving,” Proc. Advances in Cryptology—Asiacrypt '99, pp. 135-149, 1999.
[9] J. López and R. Dahab, “An Improvement of the Guajardo-Paar Method for Multiplication on Non-Supersingular Elliptic Curves,” Proc. 18th Int'l Conf. Chilean Computer Science Soc., vol. 1, pp. 1-10, 1998.
[10] R. Schroeppel, S. O'Malley, H. Orman, and O. Spatscheck, “A Fast Software Implementation for Arithmetic Operations in GF($2^n$),” Proc. Advances in Cryptology–CRYPTO '95, pp. 43-56, 1995.
[11] E. De Win, A. Bosselaers, S. Vanderberghe, P. De Gersem, and J. Vandewalle, “A Fast Software Implementation for Arithmetic Operations in$\big. {\rm GF(2^n)}\bigr.$,” Advances in Cryptology, Proc. Asiacrypt '96, K. Kim and T. Matsumoto, eds., pp. 65-76, 1996.
[12] A. Weimerskirch, C. Paar, and S.C. Shantz, “Elliptic Curve Cryptography on a Palm OS Device,” Proc. Sixth Australasian Conf. Information Security and Privacy (ACISP 2001), p. 502, July 2001.

Index Terms:
Public-key cryptography, elliptic curves, point addition, projective coordinates, scalar multiplication.
Citation:
Essame Al-Daoud, Ramlan Mahmod, Mohammad Rushdan, Adem Kilicman, "A New Addition Formula for Elliptic Curves over GF(2^n)," IEEE Transactions on Computers, vol. 51, no. 8, pp. 972-975, Aug. 2002, doi:10.1109/TC.2002.1024743
Usage of this product signifies your acceptance of the Terms of Use.