Software implementation of elliptic curve cryptography over binary fields

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

Volumn 1965, Issue , 2000, Pages 1-24

  Hankerson, Darrel ^a   Hernandez, Julio López ^b   Menezes, Alfred ^c  

^a AUBURN UNIVERSITY   (United States)

^b UNIVERSIDAD DEL VALLE   (Colombia)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; CRYPTOGRAPHY; GEOMETRY; HARDWARE; PUBLIC KEY CRYPTOGRAPHY;

BINARY FIELDS; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOGRAPHY; PENTIUM; SOFTWARE IMPLEMENTATION;

EMBEDDED SYSTEMS;

EID: 0038670954     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (38)

1. ANSI X9.62, Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA), 1999.
2. ANSI X9.63, Public Key Cryptography for the Financial Services Industry: Elliptic Curve Key Agreement and Key Transport Protocols, working draft, August 1999.
3. E. Brickell, D. Gordon, K. McCurley and D. Wilson, “Fast exponentiation with precomputation", Advances in Cryptology-Eurocrypt '92, LNCS 658, 1993, 200-207.
4. M. Brown, D. Cheung, D. Hankerson, J. Hernandez, M. Kirkup and A. Menezes, “PGP in constrained wireless devices", Proceedings of the Ninth USENIX Security Symposium, 2000.
5. D. Chudnovsky and G. Chudnovsky, “Sequences of numbers generated by addition in formal groups and new primality and factoring tests", Advances in Applied Mathematics, 7 (1987), 385-434.
6. E. De Win, A. Bosselaers, S. Vandenberghe, P. De Gersem and J. Vandewalle, “A fast software implementation for arithmetic operations in GF(2n)", Advances in Cryptology-Asiacrypt '96, LNCS 1163, 1996, 65-76.
7. E. De Win, S. Mister, B. Preneel and M. Wiener, “On the performance of signature schemes based on elliptic curves", Algorithmic Number Theory, Proceedings Third Intern. Symp., ANTS-III, LNCS 1423, 1998, 252-266.
8. T. ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms", IEEE Transactions on Information Theory, 31 (1985), 469-472.
9. S. Galbraith and N. Smart, “A cryptographic application of Weil descent", Codes and Cryptography, LNCS 1746, 1999, 191-200.
10. P. Gaudry, F. Hess and N. Smart, “Constructive and destructive facets of Weil descent on elliptic curves", preprint, January 2000.
11. D. Gordon, “A survey of fast exponentiation methods", Journal of Algorithms, 27 (1998), 129-146.
12. J. Guajardo and C. Paar, “Efficient algorithms for elliptic curve cryptosystems", Advances in Cryptology-Crypto'97, LNCS 1294, 1997, 342-356.
13. IEEE P1363, Standard Specifications for Public-Key Cryptography, 2000.
14. ISO/IEC 14888-3, Information Technology-Security Techniques-Digital Signatures with Appendix-Part 3: Certificate Based-Mechanisms, 1998.
15. ISO/IEC 15946, Information Technology-Security Techniques-Cryptographic Techniques Based on Elliptic Curves, Committee Draft (CD), 1999.
16. D. Johnson and A. Menezes, “The elliptic curve digital signature algorithm (ECDSA)", Technical report CORR 99-34, Dept. of C&O, University of Waterloo, 1999.
17. E. Knudsen, “Elliptic scalar multiplication using point halving", Advances in Cryptology-Asiacrypt '99, LNCS 1716, 1999, 135-149.
18. D. Knuth, The Art of Computer Programming-Seminumerical Algorithms, Addison-Wesley, 3rd edition, 1998.
19. N. Koblitz, “Elliptic curve cryptosystems", Mathematics of Computation, 48 (1987), 203-209.
20. N. Koblitz, “CM-curves with good cryptographic properties", Advances in Cryptology-Crypto'91, LNCS 576, 1992, 279-287.
21. N. Koblitz, A. Menezes and S. Vanstone, “The state of elliptic curve cryptography", Designs, Codes and Cryptography, 19 (2000), 173-193.
22. Ç. K. Koç and T. Acar, “Montgomery multiplication in GF(2k)", Designs, Codes and Cryptography, 14 (1998), 57-69.
23. K. Koyama and Y. Tsuruoka, “Speeding up elliptic cryptosystems by using a signed binary window method", Advances in Cryptology-Crypto'92, LNCS 740, 1993, 345-357.
24. C. Lim and P. Lee, “More flexible exponentiation with precomputation", Advances in Cryptology-Crypto'94, LNCS 839, 1994, 95-107.
25. J. López and R. Dahab, “Improved algorithms for elliptic curve arithmetic in GF(2n)", Selected Areas in Cryptography-SAC '98, LNCS 1556, 1999, 201-212.
26. J. Lóopez and R. Dahab, “Fast multiplication on elliptic curves over GF(2n) without precomputation", Cryptographic Hardware and Embedded Systems-CHES '99, LNCS 1717, 1999, 316-327.
27. J. López and R. Dahab, “High-speed software multiplication in F2m", preprint, 2000.
28. A. Menezes, P. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997.
29. V. Miller, “Uses of elliptic curves in cryptography", Advances in Cryptology-Crypto'85, LNCS 218, 1986, 417-426.
30. A. Miyaji, T. Ono and H. Cohen, “Efficient elliptic curve exponentiation", Proceedings of ICICS '97, LNCS 1334, 1997, 282-290.
31. P. Montgomery, “Speeding up the Pollard and elliptic curve methods of factorization", Mathematics of Computation, 48 (1987), 243-264.
32. F. Morain and J. Olivos, “Speeding up the computations on an elliptic curve using addition-subtraction chains", Informatique théorique et Applications, 24 (1990), 531-544.
33. National Institute of Standards and Technology, Digital Signature Standard, FIPS Publication 186-2, February 2000.
34. National Institute of Standards and Technology, Advanced Encryption Standard, work in progress.
35. OpenSSL, http://www.openssl.org
36. R. Schroeppel, “Elliptic curve point halving wins big", preprint, 2000.
37. R. Schroeppel, H. Orman, S. O'Malley and O. Spatscheck, “Fast key exchange with elliptic curve systems", Advances in Cryptology-Crypto'95, LNCS 963, 1995, 43-56.
38. J. Solinas, “Eficient arithmetic on Koblitz curves", Designs, Codes and Cryptography, 19 (2000), 195-249.