Abstract
This contribution describes three algorithms for efficient implementations of elliptic curve cryptosystems. The first algorithm is an entirely new approach which accelerates the multiplications of points which is the core operation in elliptic curve public-key systems. The algorithm works in conjunction with the k-ary or sliding window method. The algorithm explores computational advantages by computing repeated point doublings directly through closed formulae rather than from individual point doublings. This approach reduces the number of inversions in the underlying finite field at the cost of extra multiplications. For many practical implementations, where field inversion is at least four times as costly as field multiplication, the new approach proofs to be faster than traditional point multiplication methods. The second algorithm deals with efficient inversion in composite Galois fields of the form GF((2n)n). Based on an idea of Itoh and Tsujii, we optimize the algorithm for software implementation of elliptic curves. The algorithm reduced inversion in the composite field to inversion in the subfield GF(2n). The third algorithm describes the application of the Karatsuba-Ofman Algorithm to multiplication in GF((2n)n). We provide a detailed complexity analysis of the algorithm for the case that subfield arithmetic is performed through table look-up. We apply all three algorithms to an implementation of an elliptic curve system over GF((216)11). We provide absolute performance measures for the field operations and for an entire point multiplication.
This work was sponsored in part by GTE Corporation.
Chapter PDF
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
D. Beauregard. Efficient algorithms for implementing elliptic curve public-key schemes. Master's thesis, ECE Dept., Worcester Polytechnic Institute, Worcester, MA, May 1996.
H. Cohen. A Course in Computational Algebraic Number Theory. Springer-Verlag, Berlin, 1993.
R.J. Fateman. Polynomial multiplication, powers and asymptotic analysis: Some comments. SIAM J. Comput., 7(3):196–21, September 1974.
J. Guajardo. Efficient algorithms for elliptic curve cryptosystems. Master's thesis, ECE Dept., Worcester Polytechnic Institute, Worcester, MA, May 1997.
G. Harper, A. Menezes, and S. Vanstone. Public-key cryptosystems with very small key lengths. In Advances in Cryptology — EUROCRYPT '92, pages 163–173, May 1992.
T. Itoh and S. Tsujii. A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases. Information and Computation, 78:171–177, 1988.
D.E. Knuth. The Art of Computer Programming. Volume 2: Seminumerical Algorithms. Addison-Wesley, Reading, Massachusetts, 2nd edition, 1981.
N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203–209, 1987.
N. Koblitz. Constructing elliptic curve cryptosystems in characteristic 2. In Advances in Cryptology — CRYPTO '90, pages 156–167. Springer-Verlag, Berlin, 1991.
C. K. Koc. Analysis of sliding window techniques for exponentiation. Computers and Mathematics with Applications, 30(10):17–24, November 1995.
J. Koeller, A. Menezes, M. Qu, and S. Vanstone. Elliptic Curve Systems. Draft 8, IEEE P1363 Standard for RSA, Diffie-Hellman and Related Public-Key Cryptography, May 1996. working document.
R. Lidl and H. Niederreiter. Finite Fields, volume 20 of Encyclopedia of Mathematics and its Applications. Addison-Wesley, Reading, Massachusetts, 1983.
A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, Boca Raton, Florida, 1997.
A. J. Menezes, S. A. Vanstone, and R. J. Zuccherato. Counting points on elliptic curves over F2m. Mathematics of Computation, 60(201):407–420, January 1993.
A.J. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.
V. Miller. Uses of elliptic curves in cryptography. In Advances in Cryptology — CRYPTO '85, pages 417–426. Springer-Verlag, Berlin, 1986.
C Paar. Efficient VLSI Architectures for Bit-Parallel Computation in Galois Fields. PhD thesis, (Engl. transl.), Institute for Experimental Mathematics, University of Essen, Essen, Germany, June 1994.
C. Paar. Some remarks on efficient inversion in finite fields. In 1995 IEEE International Symposium on Information Theory, page 58, Whistler, B.C. Canada, September 17–22 1995.
C. Paar. A new architecture for a parallel finite field multiplier with low complexity based on composite fields. IEEE Transactions on Computers, 45(7):856–861, July 1996.
C. Paar and P. Soria-Rodriguez. Fast arithmetic architectures for public-key algorithms over galois fields GF((2n)m). In Advances in Cryptology — EUROCRYPT '97, pages 363–378, 1997.
R. Schroeppel, H. Orman, S. O'Malley, and O. Spatscheck. Fast key exchange with elliptic curve systems. Advances in Cryptology, Crypto 95, pages 43–56, 1995.
E. De Win, A. Bosselaers, S. Vandenberghe, P. De Gersem, and J. Vandewalle. A fast software implementation for arithmetic operations in GF(2n). In Asiacrypt '96. Springer Lecture Notes in Computer Science, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Guajardo, J., Paar, C. (1997). Efficient algorithms for elliptic curve cryptosystems. In: Kaliski, B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052247
Download citation
DOI: https://doi.org/10.1007/BFb0052247
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63384-6
Online ISBN: 978-3-540-69528-8
eBook Packages: Springer Book Archive