Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

IEEE Transactions on Computers

Volumn 47, Issue 3, 1998, Pages 353-356

  Koc C K ^a,b   Sunar, B ^b  

^a IEEE   (United States)

^b Oregon State University   (United States)

Author keywords

All one polynomial; Canonical basis; Finite fields; Multiplication; Normal basis

Indexed keywords

COMPUTATIONAL COMPLEXITY; LOGIC GATES; MATHEMATICAL MODELS; MATRIX ALGEBRA; POLYNOMIALS;

BIT PARALLEL CANONICAL BASIS MULTIPLIER; FINITE FIELDS;

PARALLEL PROCESSING SYSTEMS;

EID: 0032023646     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.660172     Document Type: Article

References (9)

1. m)," IEEE Trans. Computers, vol. 41, no. 8, pp. 962-971, Aug. 1992.
2. M.A. Hasan, M.Z. Wang, and V.K. Bhargava, "A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields," IEEE Trans. Computers, vol. 42, no. 10, pp. 1,278-1,280, Oct. 1993.
3. m)," Information and Computation, vol. 83, pp. 21-40, 1989.
4. R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications. New York: Cambridge Univ. Press, 1994.
5. m)," Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, Proc. Sixth Int'l Conf., AAECC-6, T. Mora, ed., pp. 297-309, Rome, July 1988. New York: Springer-Verlag.
6. Applications of Finite Fields, A.J. Menezes, ed. Boston: Kluwer Academic, 1993.
7. J. Omura and J. Massey, "Computational Method and Apparatus for Finite Field Arithmetic," U.S. Patent Number 4,587,627, May 1986.
8. C. Paar, "Efficient VLSI Architectures for Bit Parallel Computation in Galois Fields," PhD thesis, Universität GH Essen, VDI Verlag, 1994.
9. m)," IEEE Trans. Computers, vol. 34, no. 8, pp. 709-717, Aug. 1985.