This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields
October 1993 (vol. 42 no. 10)
pp. 1278-1280

A Massey-Omura parallel multiplier of finite fields GF(2/sup m/) contains m identical blocks whose inputs are cyclically shifted versions of one another. It is shown that for fields GF(2/sup m/) generated by irreducible all one polynomials, a portion of the block is independent of the input cyclic shift; hence, the multiplier contains redundancy. By removing the redundancy, a modified parallel multiplier is presented which is modular and has a lower circuit complexity.

[1] 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(2m),"IEEE Trans. Comput., vol. C-34, pp. 709-716, Aug. 1985.
[2] R. Lidl and H. Niederreiter,Introduction to Finite Fields and Their Applications. Cambridge, MA: Cambridge Univ., 1986.
[3] W. Diffie and M. Hellman, "New directions in cryptography,"IEEE Trans. Inform. Theory, vol. IT-22, pp. 644-654, 1976.
[4] I. S. Reed and T. K. Truong, "The use of finite fields to compute convolutions,"IEEE Trans. Inform. Theory, vol. IT-21, Mar. 1975.
[5] E. D. Mastrovito, "VLSI architectures for computations in Galois fields," Ph.D. dissertation, Dept. Elec. Eng., Linköping Univ., Linköping, Sweden, 1991.
[6] M. A. Hasan, M. Z. Wang, and V. K. Bhargava, "Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m),"IEEE Trans. Comput., vol. 41, pp. 962-971, Aug. 1992.
[7] P. K. S. Wah and M. Z. Wang, "Realization and application of the Massey-Omura lock," presented at the Int. Zurich Sem., 1984.
[8] T. Itoh and S. Tsujii, "Structure of parallel multipliers for a class of fields GF(2m),"Inform. Comp., vol. 83, pp. 21-40, 1989.
[9] C. E. Stroud and A. E. Barbour, "Design for testability and test generation for static redundancy system level fault-tolerant circuits," inProc. IEEE Int. Test Conf., Washington DC, Aug. 29-31, 1989, pp. 812-818.
[10] C. C. Wang, "Exponentiation in finite fields," Ph.D. Dissertation, School Eng. Appl. Sci., Univ. Calif. Los Angeles, 1985.

Index Terms:
Massey-Omura parallel multiplier; finite fields; cyclically shifted versions; polynomials; input cyclic shift; redundancy; lower circuit complexity; digital arithmetic; multiplying circuits; polynomials.
Citation:
M.A. Hasan, M.Z. Wang, V.K. Bhargava, "A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields," IEEE Transactions on Computers, vol. 42, no. 10, pp. 1278-1280, Oct. 1993, doi:10.1109/12.257715
Usage of this product signifies your acceptance of the Terms of Use.