Efficient software implementation for finite field multiplication in normal basis

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

Volumn 2229, Issue , 2001, Pages 177-188

  Ning, Peng ^a   Yin, Yiqun Lisa ^b  

^a North Carolina State University   (United States)

^b NTT Multimedia Communications Laboratories   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

ARITHMETIC OPERATIONS; BINARY FIELDS; BUILDING BLOCKES; CRYPTOGRAPHIC OPERATIONS; ELLIPTIC CURVE CRYPTOSYSTEMS; FINITE FIELD ARITHMETIC; FINITE FIELD MULTIPLICATION; SOFTWARE IMPLEMENTATION;

NETWORK SECURITY;

EID: 84956974817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45600-7_21     Document Type: Conference Paper

References (16)

1. D. Ash, I. Blake, and S.A. Vanstone. Low Complexity Normal Basis. Discrete Applied Mathematics, Vol. 25, 1989.
2. n). In Proc. Asiacrypt’96, 1996.
3. D. Hankerson, J.L. Hernandez, and A. Menesez. Software Implementation of Elliptic Curve Cryptography over Binary Fields. In Proc. CHES’2000, August 2000.
4. IEEE P1363-2000. Standard Specifications for Public Key Cryptography. August 2000.
5. B. Kaliski and M. Liskov. Efficient Finite Field Basis Conversion Involving a Dual Basis. In Proc. CHES’99, August 1999.
6. B. Kaliski and Y.L. Yin. Storage Efficient Finite Field Basis Conversion. In Proc. SAC’98, August 1998.
7. R.J. Lambert and A. Vadekar. Method and apparatus for finite field multiplication. US Patent 6,049,815, April 2000.
8. m). Technical report, IC-00-09, May 2000. Available at http://www.dcc.unicamp.br/ic-main/publications-e.html.
9. J. L. Massey and J. K. Omura. Computational method and apparatus for finite field arithmetic. U.S. Patent 4,587,627, May 1986.
10. R.C. Mullin. Multiple Bit Multiplier. U.S. Patent 5,787,028, July 1998.
11. R.C. Mullin, I.M. Onyszchuk, and S.A. Vanstone. Computational Method and Apparatus for Finite Field Multiplication. U.S. Patent 4,745,568, May 1988.
12. m). Discrete Applied Mathematics, Vol. 22, 1988/1989.
13. P. Ning and Y. L. Yin. Efficient Software Implementation for Finite Field Multiplication in Normal Basis. Pending US Patent Application. Provisional patent application filed in December 1997.
14. M. Rosing. Implementing Elliptic Curve Cryptography. Manning Publications Co., 1999.
15. A. Reyhani-Masoleh, M. A. Hasan. Fast Normal Basis Multiplication Using General Purpose Processors. To appear in the 8th Workshop on Selected Areas in Cryptography (SAC 2001). August 2001.
16. National Institute of Standards and Technology, Digital Signature Standard, FIPS Publication 186-2, February 2000.