Abstract
This paper describes three contributions for efficient implementation of elliptic curve cryptosystems in GF(2n). The first is a new method for doubling an elliptic curve point, which is simpler to implement than the fastest known method, due to Schroeppel, and which favors sparse elliptic curve coefficients. The second is a generalized and improved version of the Guajardo and Paar’s formulas for computing repeated doubling points. The third contribution consists of a new kind of projective coordinates that provides the fastest known arithmetic on elliptic curves. The algorithms resulting from this new formulation lead to a running time improvement for computing a scalar multiplication of about 17% over previous projective coordinate methods.
Research supported by a CAPES-Brazil scholarship
Partially supported by a PRONEX-FINEP grant no. 107/97
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. Diffie and M. Hellman, “New Directions in Cryptography,” IEEE Transactions in Informations Theory, IT-22:644–654, November 1976.
J. Guajardo and C. Paar, “Efficient Algorithms for Elliptic Curve Cryptosystems”, Advances in Cryptology, Proc. Crypto’97, LNCS 1294, B. Kaliski, Ed., Springer-Verlag, 1997,pp. 342–356.
K Koyama and Y. Tsuruoka, “Speeding up elliptic cryptosystems by using a signed binary window method,” Advances in Cryptology, Proc. Crypto’92, LNCS 740, E. Brickell, Ed., Springer-Verlag, 1993, pp. 345–357.
A.Menezes, Elliptic curve public key cryptosystems, Kluwer Academic Publishers, 1993.
IEEEP1363: Editorial Contribution to Standard for Public Key Cryptography, February 9, 1998.
R. Schroeppel, H. Orman, S. O’Malley and O. Spatscheck, “Fast key exchange with elliptic curve systems,” Advances in Cryptology, Proc. Crypto’95, LNCS 963, D. Coppersmith, Ed., Springer-Verlag, 1995, pp. 43–56.
R. Schroeppel, “Faster Elliptic Calculations in GF(2n),” preprint, March6, 1998.
J. Solinas, “An improved algorithm for arithmetic on a family of elliptic curves,” Advances in Cryptology, Proc. Crypto’97, LNCS 1294, B. Kaliski, Ed., Spring-Verlag, 1997, pp. 357–371.
E. De Win, A. Bosselaers, S. Vanderberghe, P. De Gersem and J. Vandewalle, “A fast software implementation for arithmetic operations in GF(2n),” Advances in Cryptology, Proc. Asiacrypt’96, LNCS 1163, K. Kim and T. Matsumoto, Eds., Springer-Verlag, 1996, pp. 65–76.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
López, J., Dahab, R. (1999). Improved Algorithms for Elliptic Curve Arithmetic in GF(2n). In: Tavares, S., Meijer, H. (eds) Selected Areas in Cryptography. SAC 1998. Lecture Notes in Computer Science, vol 1556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48892-8_16
Download citation
DOI: https://doi.org/10.1007/3-540-48892-8_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65894-8
Online ISBN: 978-3-540-48892-7
eBook Packages: Springer Book Archive