Optimal extension fields for fast arithmetic in public-key algorithms

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

Volumn 1462, Issue , 1998, Pages 472-485

  Bailey, Daniel V ^a   Paar, Christof ^b  

^a Worcester Polytechnic Institute   (United States)

^b WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Binomials; Cryptographic implementation; Elliptic curves; Fast arithmetic; Finite fields; Hyperelliptic curves; Modular reduction; OEF; Optimal extension fields; Pseudo mersenne primes

Indexed keywords

ALGORITHMS; APPLICATION PROGRAMS; CRYPTOGRAPHY; GEOMETRY; LARGE SCALE SYSTEMS; PUBLIC KEY CRYPTOGRAPHY;

BINOMIALS; CRYPTOGRAPHIC IMPLEMENTATION; ELLIPTIC CURVE; FAST ARITHMETIC; FINITE FIELDS; HYPER-ELLIPTIC CURVES; MODULAR REDUCTION; OPTIMAL EXTENSION FIELD; PSEUDO-MERSENNE PRIMES;

INTEGER PROGRAMMING;

EID: 84957677506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0055748     Document Type: Conference Paper

References (19)

1. Daniel V. Bailey. Optimal extension fields. Major Qualifying Project (Senior Thesis), 1998. Computer Science Department, Worcester Polytechnic Institute, Worcester, MA, USA.
2. Richard E. Crandall. Method and apparatus for public key exchange in a cryptographic system. US Patent 5463690, 1995.
3. Jorge Guajardo and Christof Paar. Efficient algorithms for elliptic curve cryptosystems. In Advances in Cryptology-Crypto '97, pages 342-356. Springer Lecture Notes in Computer Science, August 1997.
4. 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.
5. D. Jungnickel. Finite Fields. B.I.-Wissenschaftsverlag, Mannheim, Leipzig, Wien, Zürich, 1993.
6. D.E. Knuth. The Art of Computer Programming. Volume 2: Seminumerical Algorithms. Addison-Wesley, Reading, Massachusetts, 2nd edition, 1981.
7. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48: 203-209, 1987.
8. N. Koblitz. Hyperelliptic cryptosystems. Journal of Cryptology, 1(3):129-150, 1989.
9. 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.
10. Kenji Koyama and Yukio Tsuruoka. Speeding up elliptic cryptosystems by using a signed binary window method. In Crypto '92. Springer Lecture Notes in Computer Science, 1992.
11. R. Lidl and H. Niederreiter. Finite Fields, volume 20 of Encyclopedia of Mathematics and its Applications. Addison-Wesley, Reading, Massachusetts, 1983.
12. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
13. V. Miller. Uses of elliptic curves in cryptography. In Lecture Notes in Computer Science 218: Advances in Cryptology-CRYPTO '85, pages 417-426. SpringerVerlag, Berlin, 1986.
14. Atsuko Miyaji and Makoto Tatebayashi. Method for generating and verifying electronic signatures and privacy communication using elliptic curves. US Patent 5442707, 1995.
15. S. Paulus. Ein Algorithmus zur Berechnung der Klassengruppe quadratischer Ord-nungen über Hauptidealringen. PhD thesis, Institute for Experimental Mathematics, University of Essen, Essen, Germany, June 1996.
16. 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.
17. E. De Win, A. Bosselærs, S. Vandenberghe, P. De Gersem, and J. Vandewalle. A fast software implementation for arithmetic operations in GF(2"). In Asiacrypt '96. Springer Lecture Notes in Computer Science, 1996.
18. ANSI X9.62-199x. The Elliptic Curve Digital Signature Algorithm. Draft, January 1998 working document.
19. ANSI X9.63-199x. Elliptic Curve Key Agreement and Key Transport Protocols. Draft, January 1998. working document.