On fully parallel Karatsuba multipliers for GF(2 m)

Proceedings of the IASTED International Conference on Computer Science and Technology

Volumn , Issue , 2003, Pages 405-410

  Rodriguez Henriquez F ^a   Koc C K ^b  

^a DEPARTAMENTO DE FÍSICA   (Mexico)

^b Oregon State University   (United States)

Author keywords

Finite Field Arithmetic; Galois Field GF(2 m) Multipliers; Karatsuba Multipliers

Indexed keywords

FINITE FIELD ARITHMETIC; GALOIS FIELD GF(2M) MULTIPLIERS; KARATSUBA MULTIPLIERS;

ALGORITHMS; COMPUTER ARCHITECTURE; CRYPTOGRAPHY; FINITE ELEMENT METHOD; LOGIC GATES; POLYNOMIALS;

COMPUTER SCIENCE;

EID: 1542643573     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. R. J. McEliece. Finite Fields for Computer Scientists and Engineers. Kluwer Academic Publishers, Boston, MA, 1987.
2. A. J. Menezes, I. F. Blake, X. Gao, R. C. Mullen, S. A. Vanstone, and T. Yaghoobian. Applications of Finite Fields. Kluwer Academic Publishers, Boston, MA, 1993.
3. S. B. Wicker and V. K. Bhargava, editors. Reed-Solomon Codes and Their Applications. Prentice-Hall, Englewood Cliffs, NJ, 1994.
4. M. A. Hasan, M. Z. Wang, and V. K. Bhargava. A modified Massey-Omura parallel multiplier for a class of finite fields. IEEE Transactions on Computers, 42(10):1278-1280, November 1993.
5. C. Paar. Efficient VLSI Architectures for Bit Parallel Computation in Galois Fields. PhD thesis, Universität GH Essen, VDI Verlag, 1994.
6. B. Sunar and Ç. K. Koç. Mastrovito multiplier for all trinomials. IEEE Transactions on Computers, 48(5):522-527, May 1999.
7. C. Paar. A new architecture for a paralel finite field multiplier with low complexity based on composite fields. IEEE Transactions on Computers, 45(7):856-861, July 1996.
8. J. Guajardo and C. Paar. Efficient algorithms for elliptic curve cryptosystems. In B. S. Kaliski Jr., editor, Advances in Cryptology - CRYPTO 97, Lecture Notes in Computer Science, No. 1294, pages 342-356. Springer-Verlag, Berlin, Germany, 1997.
9. K. Geddes, S. Czapor, and G. Labahn. Algorithms for Computer Algebra. Kluwer Academic Publishers, Boston, MA, 1992.
10. IEEE P1363. Standard specifications for public-key cryptography. Draft Version 7, September 1998.