Generic GF(2m) arithmetic in software and its application to ECC

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

Volumn 2727 LNCS, Issue , 2003, Pages 79-92

  Weimerskirch, André ^a   Stebila, Douglas ^b   Shantz, Sheueling Chang ^c  

^a RUHR UNIVERSITY BOCHUM   (Germany)

^b UNIVERSITY OF WATERLOO   (Canada)

^c SUN MICROSYSTEMS   (United States)

Author keywords

Binary fields; Dense field polynomials; Elliptic curves; Field multiplication; Field reduction; Koblitz curves

Indexed keywords

BINARY FIELDS; DENSE FIELD POLYNOMIALS; ELLIPTIC CURVES; FIELD MULTIPLICATION; FIELD REDUCTION; KOBLITZ CURVES; ELLIPTIC CURVE; ELLIPTIC CURVE CRYPTOGRAPHY(ECC); END-TO-END CONNECTIONS; HIGH PERFORMANCE DEVICES; PUBLIC KEY CRYPTOSYSTEMS;

MOBILE DEVICES; PORTABLE EQUIPMENT; PUBLIC KEY CRYPTOGRAPHY; SERVERS; WIRELESS NETWORKS; BINS; CRYPTOGRAPHY; GEOMETRY; MOBILE TELECOMMUNICATION SYSTEMS; SECURITY OF DATA;

POLYNOMIAL APPROXIMATION; APPLICATION PROGRAMS;

EID: 35048823217     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45067-X_8     Document Type: Conference Paper

References (24)

1. M. Brown, D. Cheung, D. Hankerson, J. L. Hernandez, M. Kirkup, and A. Menezes. PGP in Constrained Wireless Devices. Proceedings of the 9th USENIX Security Symposium, 2000.
2. n). Advances in Cryptology - ASIACRYPT '96, LNCS 1163, Springer-Verlag, 65-76, 1996.
3. P. Gaudry, F. Hess, and N. Smart. Constructive and Destructive Facets of Weil Descent on Elliptic Curves. Journal of Cryptology, 15, 19-46, 2002.
4. J. Guajardo and C. Paar. Efficient algorithms for elliptic curve cryptosystems. Advances in Cryptology - CRYPTO '97, LNCS 1294, Springer-Verlag, 342-356, 1997.
5. N. Gura, H. Eberle, and S. Chang Shantz. Generic Implementations of Elliptic Curve Cryptography using Partial Reduction. 9th ACM Conference on Computer and Communications Security, 2002.
6. D. Hankerson, J. L. Hernandez and A. Menezes. Software Implementation of Elliptic Curve Cryptography Over Binary Fields. Cryptographic Hardware and Embedded Systems, CHES 2000, LNCS 1965, Springer-Verlag, 1-24, 2000.
7. IEEE P1363. Standard Specifications for Public-Key Cryptography, 2000.
8. ISO/IEC 15946. Information Technology - Security Techniques - Cryptographic Techniques Based on Elliptic Curves, 1999.
9. k). Designs, Codes and Cryptography, 14, 57-69, 1998.
10. K. Koyama and Y. Tsuruoka. Speeding up elliptic curve cryptosystems by using a signed binary window method. Advances in Cryptology - Crypto '92, LNCS 740, Springer-Verlag, 345-357, 1993.
11. R. Lidl and H. Niederreiter. Introduction to Finite Fields and their Applications, Revised Edition. Cambridge Unversity Press, Cambridge, United Kingdom, 1994.
12. C. Lim and P. Lee. More flexible exponentiation with precomputation. Advances in Cryptology - Crypto '94, LNCS 839, Springer-Verlag, 95-107, 1994.
13. n). Selected Areas in Crytography - SAC '98, LNCS 1556, Springer-Verlag, 201-212, 1999.
14. n) without Precomputation, Cryptographic Hardware and Embedded Systems- CHES '99, LNCS 1717, Springer-Verlag, 316-327, 1999.
15. m. Indocrypt 2000, LNCS 1977, Springer-Verlag, 203-212, 2000.
16. National Institute of Standards and Technolgy. Recommended Elliptic Curves for Federal Government Use, May 1999, available from http://csrc.nist.gov/encryption.
17. OpenSSL, http://www.openssl.org.
18. R. Schroeppel, H. Orman, S. O'Malley and O. Spatscheck. Fast Key Exchange with Elliptic Curve Systems. Advances in Cryptology - Crypto '95, LNCS 963, Springer-Verlag, 43-56, 1995.
19. R. Schroeppel, C. Beaver, R. Gonzales, R. Miller, and T. Draelos. A Low-Power Design for an Elliptic Curve Digital Signature Chip. Presented at Cryptographic Hardware and Embedded Systems (CHES) 2002.
20. S. Shantz. From Euclid's GCD to Montgomery Multiplication to the Great Divide, preprint, 2000.
21. V. Shoup. NTL: A Library for doing Number Theory, available from http://www.shoup.net/ntl/.
22. J. A. Solinas. Efficient Arithmetic on Koblitz Curves. Designs, Codes and Cryptography, 19(2/3), 195-249, 2000.
23. A. Weimerskirch, C. Paar, and S. Chang Shantz. Elliptic Curve Cryptography on a Palm OS Device. The 6th Australasian Conference on Information Security and Privacy (ACISP 2001), LNCS 2119, Springer-Verlag, 502-513, 2001.
24. A. Weimerskirch and C. Paar. Generalizations of the Karatsuba Algorithm for Polynomial Multiplication. Technical Report, Ruhr-University Bochum, 2002, Available from http://www.crypto.rub.de.