Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2m)

IEEE Transactions on Computers

Volumn 41, Issue 8, 1992, Pages 962-971

  Hasan, Anwarul M ^a   Wang, Muzhong ^a   Bhargava, Vijay K ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

All one polynomial; equally spaced polynomial; finite field arithmetic; multiplicative inverse; parallel multiplier

Indexed keywords

DIGITAL ARITHMETIC; POLYNOMIALS;

FINITE FIELD ARITHMETIC;

MULTIPLYING CIRCUITS;

EID: 0026907831     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.156539     Document Type: Article

References (12)

1. R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications. Cambridge, MA: Univ., 1986.
2. C.C. Wang, T.K. Truong, H.M. Shao, L.J. Deutsch, J.K. Omura, and I.S. Reed, “VLSI architecture for computing multiplications and inverses in GF(2 m),” IEEE Trans. Comput., vol. C-34, pp. 709–716, Aug. 1985.
3. T. Itoh and S. Tsujii, “Structure of parallel multipliers for a class of fields GF(2 m),” Inform. Comp., vol. 83, 21–40, 1989.
4. P.K.S. Wah and M.Z. Wang, “Realization and application of the Massey–Omura lock,” in Proc. International Zurich Seminar, Switzerland, 1984.
5. D. W. Ash, I. F. Blake, and S. A. Vanstone, “Low complexity normal bases,” Disc. Appl. Math., vol.25 191–210, 1989.
6. Y. Sugiyama, “An algorithm for solving discrete-time Wiener-Hopf equations based on Euclid’s algorithm,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 394–409, May 1986.
7. M. A. Hasan and V. K. Bhargava, “Division and bit-serial multiplication over GF(q m),” IEE Proc., part E, vol. 139, no. 3, pp. 230–236, May 1992.
8. T. Itoh, “A fast algorithm for computing multiplicative inverses in GF(2 m),” Inform. Comp., vol. 78, 171–177, Sept. 1988.
9. M. Z. Wang, I.F. Blake, and V.K. Bhargava, “Normal bases and irreducible polynomials in the finite field GF(2 2 r),” Disc. Appl. Math., 1990, submitted for publication.
10. T. Itoh, “Characterization for a family of infinitely many irreducible equally spaced polynomials,” Inform. Process. Lett., vol. 37, pp. 272–277, Mar. 1991.
11. D. Shanks, Solved and Unsolved Problems in Number Theory, vol. 1, Washington, DC, 1962.
12. A. Pincin, “A new algorithm for multiplication in finite fields,” IEEE Trans. Comput., vol. C-38, pp. 1045–1049, July 1989.