Efficient arithmetic in finite field extensions with application in elliptic curve cryptography

Journal of Cryptology

Volumn 14, Issue 3, 2001, Pages 153-176

  Bailey, Daniel V ^a  

^a Worcester Polytechnic Institute   (United States)

Author keywords

Binomials, modular reduction; Elliptic curves; Fast arithmetic; Finite fields; Inversion

Indexed keywords

EID: 0001224411     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001450010012     Document Type: Article

References (24)

1. ANSI X3.92-1981. Data Encryption Algorithm. Technical report, 1981.
2. D. V. Bailey. Optimal Extension Fields. Major Qualifying Project (Senior Thesis), 1998. Computer Science Department, Worcester Polytechnic Institute, Worcester, MA.
3. D. V. Bailey and C. Paar. Optimal extension fields for fast arithmetic in public-key algorithms. In Advances in Cryptology-Crypto '98, pages 472-485. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1998.
4. J. R. Bastida. Field Extensions and Galois Tlieory. Encyclopedia of Mathematics and its Applications, volume 22.
5. Compaq Computer Corporation, Maynard, MA. Compaq 21264 Alpha Microprocessor Hardware Reference Manual, July 1999.
6. E. DeWm, A. Bosselaers, S. Vandenberghe, P. D. Gersem, and J. Vandewalle. A fast software implementation for arithmetic operations in GF(2). In Asiacrypt '96, pages 65-76. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1996.
7. E. DeWin, S. Mister, B. Preneel, and M. Wiener. On the performance of signature schemes based on elliptic curves. In Algorithmic Number Theory: Third International Symposium, pages 252-266. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1998.
8. J. Guajardo and C. Paar. Efficient algorithms for elliptic curve cryptosystems. In Advances in Cryptology - Crypto '97, pages 342-356. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1997.
9. T. Itoh and S. Tsujii. A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases. Information and Computation, 78:171-177, 1998.
10. H. Iwaniec and J. Pintz. Primes in short intervals. Monatshefte für Mathematik, 98:115-143,1984.
11. D. Jungnickel. Finite Fields. B.I.-Wissenschaftsverlag, Mannheim, 1993.
12. D. Knuth. The An of Computer Programming. Volume 2: Seminumerical Algorithms, 2nd edition. Addison-Wesley, Reading, MA, 1981.
13. T. Kobayashi, H. Morita, K. Kobayashi, and F. Hoshino. Fast elliptic curve algorithm combining Frobenius map and table reference to adapt to higher characteristic. In Advances in Cryptography -EUROCRYPT '99, pages 176-189. Springer-Verlag, Berlin, 1999.
14. N. Koblitz. Elliptic curve cryptoSystems. Mathematics of Computation, 48:203-209, 1987.
15. N. Koblitz. Algebraic Aspects of Cryptography. Springer-Verlag, Berlin, 1998.
16. X. Lai and J. Massey. A proposal for a new block encryption standard. In Advances in Cryptography EUROCRYPT '90, pages 389-404. Springer-Verlag, Berlin, 1990.
17. E. J. Lee, D. S. Kirn, and P. J. Lee. Speed-up of Fpm arithmetic for elliptic curve cryptosystems. In Proceedings of ICISC '98, pages 81-91. DongKwang Publishing, Seoul, 1998.
18. R. Lidl and H. Niederreiten Finite Fields. Encyclopedia of Mathematics and its Applications, volume 20. Addison-Wesley, Reading, MA, 1983.
19. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL, 1997.
20. V. Miller. Uses of elliptic curves in cryptography. In Advances in Cryptology-CRYPTO '85, pages 417-426. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1986.
21. NIST FIPS PUB 46-3. Data Encryption Standard. Technical report, 1977.
22. G. H. Norton. Extending the binary GCD algorithm. In Algebraic Algorithms and Error-Correcting Codes, pages 363-372. Springer-Verlag, Berlin, 1986.
23. R. L. Rivest. The RC5 encryption algorithm. In Proceedings of the Second Fast Software Encryption Workshop, pages 86-96. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1995.
24. 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.