Storage-efficient finite field basis conversion

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

Volumn 1556, Issue , 1999, Pages 81-93

  Kaliski, Burton S ^a   Yin, Yiqun Lisa ^b  

^a RSA   (United States)

^b RSA Laboratories   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ADDITIONAL COSTS; BASIS CONVERSION; CRYPTOGRAPHIC APPLICATIONS; FINITE FIELDS; STORAGE REQUIREMENTS;

CRYPTOGRAPHY;

EID: 84949221677     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48892-8_7     Document Type: Conference Paper

References (6)

1. ANSI X9.62: The Elliptic Curve Digital Signature Algorithm (ECDSA), draft, November 1997.
2. T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. The MIT Press, 1990.
3. IEEE P1363: Standard Specifications for Public-Key Cryptography, Draft version 3, May 1998. http://stdsbbs.ieee.org/groups/1363/draft.html.
4. A. Menezes, I. Blake, X. Gao, R. Mullin, S. Vanstone, and T. Yaghoobian. Applications of Finite Fields. Kluwer Academic Publishers, 1993.
5. A. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.
6. R. Lidl and H. Niederreiter. Finite Fields, volume 20 of Encyclopedia ofMathematics and Its Applications. Addison-Wesley, 1983.