Rings of Low Multiplicative Complexity

Finite Fields and their Applications

Volumn 6, Issue 2, 2000, Pages 175-191

  Silverman, Joseph H ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

Multiplicative complexity; finite field

Indexed keywords

EID: 0012364001     PISSN: 10715797     EISSN: None     Source Type: Journal    
DOI: 10.1006/ffta.1999.0270     Document Type: Article

References (11)

1. 155. IEEE J. Selected Areas Comm. 11:1993;804-813.
2. Gao S., Lenstra H. W. Jr. Optimal normal bases. Des. Codes Cryptogr. 2:1992;315-323.
3. Harper G., Menezes A., Vanstone S. Public-key cryptosystems with very small key lengths. Rueppel R. A., Advances in Cryptology - EUROCRYPT 92. 658:1992;163-173 Springer-Verlag, New York.
4. k). Design, Codes Cryptogr. 14:1998;57-69.
5. Lang S. Algebra. 1984;Addison-Wesley, Reading.
6. n). Discrete Appl. Math. 22:1988;149-161.
7. J. Omura, and, J. Massey, Computational Method and Apparaus for Finite Field Arithmetic, United States Patent 4587627, May 6, 1986.
8. I. Onyszchuk, R. Mullin, and, S. Vanstone, Computational Method and Apparatus for Finite Field Multiplication, United States Patent 4745568, May 17, 1988.
9. Schroeppel R., O'Malley S., Orman H., Spatscheck O. Fast key exchange with elliptic curve systems. Coppersmith D., Advances in Cryptology - CRYPTO 95. 973:1995;43-56 Springer-Verlag, New York.
10. N). Cryptographic Hardware and Embedded Systems. 1717:1999;Springer-Verlag, Berlin. p. 122-134.
11. n). Advances in Cryptology - ASIACRYPT'96. 1163:1996;Springer-Verlag, New York. p. 65-76.