An improved implementation of elliptic curves over gf(2n) when using projective point arithmetic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2259, Issue , 2001, Pages 134-150

  King, Brian ^a,b  

^a MOTOROLA INC   (United States)

^b INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

ELLIPTIC CURVE; POINT ARITHMETIC; POINT TRANSFORMATIONS;

GEOMETRY;

EID: 84949192912     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45537-x_11     Document Type: Conference Paper

References (22)

1. Agnew, G., R. Mullin, S. Vanstone, “On the development of a fast elliptic curve processor chip”, In Advances in Cryptology - Crypto’91, Springer-Verlag, 1991, pp 482-487.
2. Steven Arno and Ferrell S. Wheeler. “Signed Digit Representations of Minimal Hamming Weight”. In IEEE Transactions on Computers. 42(8), 1993, p. 1007-1009.
3. I.F. Blake, Nigel Smart, and G. Seroussi, Elliptic Curves in Cryptography. London Mathematical Society Lecture Note Series. Cambridge University Press, 1999.
4. D. V. Chudnovsky and G. V. Chudnovsky. “Sequences of numbers generated by addition in formal groups and new primality and factorization tests.” In Adv. in Appl. Math. 7 (1986) 385-434.
5. Darrel Hankerson, Julio Lopez Hernandez and Alfred Menezes. “Software Implementation of Elliptic Curve Cryptography over Binary Fields”. In CHES 2000. p. 1-24.
6. M. A. Hasan, “Look-up Table Based Large Finite Field Multiplication in Memory Constrained Cryptosystems,” In Proceeding of the 7th IMA Conference on Cryptography and Coding, Cirencester, UK, December 1999, LNCS, Springer Verlag, pp. 213-221.
7. M.A. Hasan. “Efficient computation of Multiplicative Inverses for Cryptographic Applications”. In CORR 2001-03 http://cacr.math.uwaterloo.ca.
8. T. Kobayashi, H. Morita, K. Kobayashi, and F. Hoshino. “Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic”, Advances in Cryptology - Eurocrypt’99, Springer-Verlag, 1992, pp 176-189.
9. Neal Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, Vol. 48, No. 177, 1987, 203-209.
10. Neal Koblitz, Algebraic Aspects of Cryptography, Algorithms and Computation in Mathematics,Vol. 3, Springer-Verlag, New York, 1998.
11. Neal Koblitz, “CM-curves with good cryptographic properties”, In Advances in Cryptology - Crypto’91, Springer-Verlag, 1992, 279-287.
12. Kenji Koyama and Yukio Tsuruoka. “Speeding up elliptic curve cryptosystems by using a signed binary window method”, Advances in Cryptology-Crypto’92, Springer-Verlag, 1992, pp 345-357.
13. Erik Woodward Knudsen. “Elliptic Scalar Multiplication Using Point Halving”. In Advances in Cryptology - ASIACRYPT’99. LNCS Vol. 1716, Springer, 1999, p. 135-149
14. Julio Lopez and Ricardo Dahab. “Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)”. In Selected Areas in Cryptography’98, SAC’98. LNCS 1556, Springer, 1999, p. 201-212
15. J. Lopez and R. Dahab. “Performance of elliptic curve cryptosystems”. In Technical report, IC-00-08. May 2000. Available at http://www.dcc.unicamp.br/icmain/ publications-e.html
16. Alfred Menezes, Elliptic Curve Public Key Cryptosystems, Kluwer Academic Publishers, 1993.
17. Victor S. Miller, “Use of Elliptic Curves in Cryptography”, In Advances in Cryptology CRYPTO 1985,Springer-Verlag, New York, 1985, pp 417-42
18. Volker Muller. “Efficient Algorithms for Multiplication on Elliptic Curves”, Proceedings GI-Arbeitskonferenz Chipkarten 1998, TU Munchen, 1998.
19. Volker Muller. “Fast Multiplication on Elliptic curves over small fields of characteristic two”, Journal of Cryptology, 11(4), 219-234, 1998.
20. NIST, Recommended elliptic curves for federal use, http://www.nist.gov
21. Richard Schroeppel, Hilarie Orman, Sean W. O’Malley, Oliver Spatscheck: “Fast Key Exchange with Elliptic Curve Systems”, In Advances in Cryptology - CRYPTO’95, Lecture Notes in Computer Science, Vol. 963, Springer, 1995, pp 43-56.
22. Rich Schroeppel. “Elliptic Curves: Twice as Fast!”. InRump session of CRYPTO 2000.