
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Essame AlDaoud, 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. 972975, August, 2002.  
BibTex  x  
@article{ 10.1109/TC.2002.1024743, author = {Essame AlDaoud and Ramlan Mahmod and Mohammad Rushdan and Adem Kilicman}, title = {A New Addition Formula for Elliptic Curves over GF(2^n)}, journal ={IEEE Transactions on Computers}, volume = {51}, number = {8}, issn = {00189340}, year = {2002}, pages = {972975}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2002.1024743}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A New Addition Formula for Elliptic Curves over GF(2^n) IS  8 SN  00189340 SP972 EP975 EPD  972975 A1  Essame AlDaoud, A1  Ramlan Mahmod, A1  Mohammad Rushdan, A1  Adem Kilicman, PY  2002 KW  Publickey cryptography KW  elliptic curves KW  point addition KW  projective coordinates KW  scalar multiplication. VL  51 JA  IEEE Transactions on Computers ER   
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 102 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. 316327, 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. 201212, 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. 124, 2000.
[7] J. Solinas, “Efficient Arithmetic on Koblitz Curves,” Designs, Code, and Cryptography, vol. 19, pp. 195249, 2000.
[8] E. Knudsen, “Elliptic Scalar Multiplication Using Point Halving,” Proc. Advances in Cryptology—Asiacrypt '99, pp. 135149, 1999.
[9] J. López and R. Dahab, “An Improvement of the GuajardoPaar Method for Multiplication on NonSupersingular Elliptic Curves,” Proc. 18th Int'l Conf. Chilean Computer Science Soc., vol. 1, pp. 110, 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. 4356, 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. 6576, 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.