Fast multiplication in finite fields GF(2N)

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

Volumn 1717, Issue , 1999, Pages 122-134

  Silverman, Joseph H ^a,b  

^a BROWN UNIVERSITY   (United States)

^b NTRU Cryptosystems   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

CONVOLUTION PRODUCTS; FAST MULTIPLICATION; FINITE FIELDS; MONTGOMERY MULTIPLICATION; MULTIPLICATION OPERATIONS; OPTIMAL NORMAL BASIS; QUADRATIC EQUATIONS; SQUARING OPERATIONS;

EMBEDDED SYSTEMS;

EID: 84949488199     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48059-5_12     Document Type: Conference Paper

References (29)

1. 2155. IEEE Journal on Selected Areas in Communications. 11(5) (June 1993) 804-813
2. Cohen, H. A course in computational algebraic number theory. Graduate Texts in Math., vol. 138. Springer Verlag, Berlin (1993)
3. Coppersmith, D.: Fast evaluation of discrete logarithms in fields of characteristic two. IEEE Transactions on Information Theory 30 (1984) 587-594
4. Cunningham Project.
5. Gao, S., von zur Gathen, J., Panario, D.: Gauss periods and fast exponentiation in finite fields. In: Baeza-Yates, R., Goles, E., Poblete, P.V.(eds.): Latin American Symposium on Theoretical Informatics-LATIN '95. Lecture Notes in Computer Science, Vol. 911. Springer-Verlag, New York (1995) 311-322
6. Gao, S., von zur Gathen, J., Panario, D.: Gauss periods: orders and cryptographical applications. Mathematics of Computation 67 (1998) 343-352
7. Gao, S., Lenstra, H.W., Jr.: Optimal normal bases. Design, Codes, and Cryptography. 2 (1992) 315-323
8. Gao, S., Vanstone, S.A.: On orders of optimal normal basis generators. Mathematics of Computation 64 (1995) 1227-1233
9. Gordon, D.M., McCurley, K.S.: Massively parallel computation of discrete logarithms. In: Brickell, E.F. (ed.): Advances in cryptology-CRYPTO '92. Lecture Notes in Computer Science, Vol. 740. Springer-Verlag, New York (1993) 16-20
10. Harkins, D., Carrel, D.: The Internet Key Exchange, RFC 2409 Network Working Group (November 1998),
11. Harper, G., Menezes, A., Vanstone, S.: Public-key cryptosystems with vey small key lengths. In: Rueppel, R.A. (ed.): Advances in Cryptology — EUROCRYPT 92. Lecture Notes in Computer Science, Vol. 658. Springer-Verlag, New York (1992) 163-173
12. Hooley, C.: On Artin's conjecture. J. Reine Angew. Math. 225 (1997) 209-220
13. fc). Design, Codes and Cryptography. 14 (1998) 57-69
14. Montgomery, P.L.: Modular multiplication without trial division. Math. Comp. 44 (1985) 519-521
15. n). Discrete Applied Mathematics. 22 (1988) 149-161
16. Odlyzko, A.M.: Discrete logarithms and smooth polynomials. In: Mullen, G.L., Shiue, P. (eds.): Finite Fields: Theory, Applications and Algorithms. Amer. Math. Soc., Contemporary Math. #168 (1994) 269-278
17. Odlyzko, A.M.: Discrete logarithms: The past and the future. Preprint, July 1999.
18. Omura, J., Massey, J.: Computational method and apparatus for finite field arithmetic. United States Patent 4587627 (May 6), 1986
19. Onyszchuk, I., Mullin, R., Vanstone, S.: Computational method and apparatus for finite field multiplication. United States Patent 4745568 (May 17), 1988
20. Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Transactions on Information Theory. 24 (1978) 106-110
21. Rosing, M.: Implementing Elliptic Curve Cryptography. Manning Publications Greenwich, CT (1999)
22. Semaev, I. A.: An algorithm for evaluation of discrete logarithms in some nonprime finite fields. Math. Comp. 67 (1998) 1679-1689
23. Schroeppel, R., O'Malley, S., Orman, H., Spatscheck, O.: Fast key exchange with elliptic curve systems In: Coppersmith, D. (ed.): Advances in Cryptology — CRYPTO 95. Lecture Notes in Computer Science, Vol. 973. Springer-Verlag, New York (1995) 43-56
24. Silverman, J.H.: Low Complexity Multiplication in Rings. Preprint, April 14, 1999
25. Washington, L.: Introduction to Cyclotomic Fields. Springer-Verlag New York (1982).
26. n). In: Advances in Cryptology — ASIACRYPT '96. Lecture Notes in Computer Science, Vol. 1163. Springer-Verlag New York (1996) 65-76
27. m) yielding small complexity arithmetic circuits. IEEE Trans. Comput. 47 (1998), no. 9, 938-946
28. m). Information and Computers 83 (1989), 21-40
29. m). Topics in Discrete Mathematics 106/107 (1992), 497-502