A new low complexity parallel multiplier for a class of finite fields

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

Volumn 2162, Issue , 2001, Pages 160-170

  Leone, Manuel ^a  

^a TELECOM ITALIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

ALL-ONE POLYNOMIAL; CANONICAL BASIS; FINITE FIELDS; IRREDUCIBLE POLYNOMIALS; OPTIMAL NORMAL BASIS; PARALLEL MULTIPLIERS; SPACE COMPLEXITY;

EMBEDDED SYSTEMS;

EID: 84870502481     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44709-1_15     Document Type: Conference Paper

References (12)

1. Aho A.V., Hopcroft J.E., Ullman J.D., “The Design and Analysis of Computer Algorithms”, Addison-Wesley, Reading, Mass., 1975.
2. Drolet G., “A New Representation of Elements of Finite Fields GF(2m) Yelding Small Complexity Arithmetic Circuit”, IEEE Trans. on Computers, vol.47, pp.938-946, 1998.
3. Koç C.K., Sunar B., “Low Complexity Bit-Parallel Canonical and Normal Basis Mutipliers for a Class of Finite Fields”, IEEE Trans. on Computers, vol.47, pp.353-356, March 1998.
4. Omura J., Massey J., “Computational method and apparatus for finite field arithmetic”, U.S. Patent Number 4,587,627, May 1986.
5. Hasan M.H., Wang M.Z., Bhargava V.K., “Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m)”, IEEE Trans. on Computers, vol.41, no. 8, pp.962-971, August 1992.
6. Hasan M.H., Wang M.Z., Bhargava V.K., “A modified Massey-Omura Multiplier for a class of finite fields”, IEEE Trans. on Computers, vol.42, no. 10, pp.1278-1280, October 1993.
7. Itho T., Tsujii S., “Structure of parallel multipliers for a class of Finite Fields GF(2m)”, Information and Computation, vol.83, pp.21-40, 1989.
8. Paar C., “A new architecture for a parallel finite field multiplier with low complexity based on composite fields”, IEEE Trans. on Computers, vol.45, no. 7, pp.846-861, July 1996.
9. Menezes A.J., Blake I., Gao X., Mullin R., Vanstone S. and Yaghoobian T., “Applications of Finite Fields”, Boston, MA: Kluwer Academic Publisher, 1993.
10. Mastrovito E.D., “VLSI Architectures for multiplication over finite field GF(2m)”, In T. Mora, editor, Applied Algebra Algebraic Algorithms, and Error-Correcting Codes, 6-th International Conference, AAECC-6, pp. 297-309, Roma, Italy, July 1988. New York, NY: Springer-Verlag.
11. Knuth D.E., “The art of the computing programming”, Vol.2: Seminumerical algorithms, Adison-Wilsey, Reading, MA., 1969.
12. Elia M., Leone M. and Visentin C., “Low Complexity bit-parallel multipliers for GF(2m) with generator polynomial xm+xk+1”, Electronics Letters, Vol.35, No.7, April 1999.