Publication 2002 Issue No. 5 - May Abstract - A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})
A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})
May 2002 (vol. 51 no. 5)
pp. 511-520
 ASCII Text x A. Reyhani-Masoleh, M.A. Hasan, "A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})," IEEE Transactions on Computers, vol. 51, no. 5, pp. 511-520, May, 2002.
 BibTex x @article{ 10.1109/TC.2002.1004590,author = {A. Reyhani-Masoleh and M.A. Hasan},title = {A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})},journal ={IEEE Transactions on Computers},volume = {51},number = {5},issn = {0018-9340},year = {2002},pages = {511-520},doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2002.1004590},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on ComputersTI - A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})IS - 5SN - 0018-9340SP511EP520EPD - 511-520A1 - A. Reyhani-Masoleh, A1 - M.A. Hasan, PY - 2002KW - Finite fieldKW - Massey-Omura multiplierKW - all-one polynomialKW - optimal normal basesVL - 51JA - IEEE Transactions on ComputersER -

The Massey-Omura multiplier of GF(2^{m}) uses a normal basis and its bit parallel version is usually implemented using m identical combinational logic blocks whose inputs are cyclically shifted from one another. In the past, it was shown that, for a class of finite fields defined by irreducible all-one polynomials, the parallel Massey-Omura multiplier had redundancy and a modified architecture of lower circuit complexity was proposed. In this article, it is shown that, not only does this type of multipliers contain redundancy in that special class of finite fields, but it also has redundancy in fields GF(2^{m}) defined by any irreducible polynomial. By removing the redundancy, we propose a new architecture for the normal basis parallel multiplier, which is applicable to any arbitrary finite field and has significantly lower circuit complexity compared to the original Massey-Omura normal basis parallel multiplier. The proposed multiplier structure is also modular and, hence, suitable for VLSI realization. When applied to fields defined by the irreducible all-one polynomials, the multiplier's circuit complexity matches the best result available in the open literature.

[1] G.B. Agnew, T. Beth, R.C. Mullin, and S.A. Vanstone, “Arithmetic Operations in$GF(2^m)$,” J. Cryptology, vol. 6, pp. 3-13, 1993.
[2] D.W. Ash, I.F. Blake, and S.A. Vanstone, “Low Complexity Normal Bases,” Discrete Applied Math., vol. 25, pp. 191-210, 1989.
[3] G. Drolet, “A New Representation of Elements of Finite Fields$\big. {\rm GF}(2^m)\bigr.$Yielding Small Complexity Arithmetic Circuits,” IEEE Trans. Computers, vol. 47, no. 9, pp. 938-946, Sept. 1998.
[4] M. Elia, M. Leone, and C. Visentin, “Low Complexity Bit-Parallel Multipliers for$GF(2^m)$with Generator Polynomial$x^m+x^k+1$,” Electronics Letters, vol. 35, no. 7, pp. 551-552, Apr. 1999.
[5] S.T.J. Fenn, M. Benaissa, and D. Taylor, $GF(2^m)$Multiplication and Division over the Dual Basis IEEE Trans. Computers, vol. 45, no. 3, pp. 319-327, Mar. 1996.
[6] S. Gao and H.W. Lenstra Jr., Optimal Normal Bases Designs, Codes and Cryptography, vol. 2, pp. 315-323, 1992.
[7] J.H. Guo and C.L. Wang, Systolic Array Implementation of Euclid's Algorithm for Inversion and Division in$GF(2^m)$ IEEE Trans. Computers, vol. 47, no. 10, pp. 1161-1167, Oct. 1998.
[8] A. Halbutogullari and C.K. Koc, Mastrovito Multiplier for General Irreducible Polynomials IEEE Trans. Computers, vol. 49, no. 5, pp. 503-518, May 2000.
[9] M.A. Hasan, M. Wang, and V.K. Bhargava, Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields$GF(2^m)$ IEEE Trans. Computers, vol. 41, no. 8, pp. 962-971, Aug. 1992.
[10] 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. 1278-1280, Oct. 1993.
[11] I.S. Hsu,T.K. Truong,L.J. Deutsch, and I.S. Reed,"A Comparison of VLSI Architectures of Finite Field Multipliers Using Dual, Normal or Standard Bases," IEEE Trans. Computers, vol. 37, no. 6, pp. 735-737, June 1988.
[12] T. Itoh and S. Tsujii, “Structure of Parallel Multipliers for a Class of Finite Fields$GF(2^m)$,” Information and Computation, vol. 83, pp. 21-40, 1989.
[13] Ç.K. Koç and B. Sunar, Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields IEEE Trans. Computers, vol. 47, no. 3, pp. 353-356, Mar. 1998.
[14] R. Lidl and H. Niederreiter,An Introduction to Finite Fields and Their Applications.Cambridge: Cambridge Univ. Press, 1986.
[15] J.L. Massey and J.K. Omura, Computational Method and Apparatus for Finite Field Arithmetic, US Patent No. 4,587,627, to OMNET Assoc., Sunnyvale CA, Washington, D.C.: Patent and Trademark Office, 1986.
[16] E.D. Mastrovito,"VLSI Design for Multiplication over Finite Fields," LNCS-357, Proc. AAECC-6, pp. 297-309,Rome, July 1988, Springer-Verlag.
[17] E.D. Mastrovito, “VLSI Architectures for Computation in Galois Fields,” PhD thesis, Linkoping Univ., Linkoping, Sweden, 1991.
[18] A.J. Menezes, I.F. Blake, X. Gao, R.C. Mullin, S.A. Vanstone, and T. Yaghoobian, Applications of Finite Fields. Kluwer Academic, 1993.
[19] R.C. Mullin,I.M. Onyszchuk,S.A. Vanstone, and R.M. Wilson,"Optimal Normal Bases inGF(pn)," Discrete Applied Maths., pp. 142-169, 1988/89.
[20] C. Paar, “A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields,” IEEE Trans. Computers, vol. 45, no. 7, pp. 846-861, July 1996.
[21] C. Paar, P. Fleischmann, and P. Roelse, “Efficient Multiplier Architectures for Galois Fields,” IEEE Trans. Computers, vol. 47, no. 2, pp. 162-170, Feb. 1998.
[22] A. Reyhani-Masoleh and M.A. Hasan, “A Reduced Redundancy Massey-Omura Parallel Multiplier over$GF(2^m)$,” Proc. 20th Biennial Symp. Comm., pp. 308-312, May 2000.
[23] B. Sunar and Ç.K. Koç, Mastrovito Multiplier for All Trinomials IEEE Trans. Computers, vol. 48, no. 5, pp. 522-527, May 1999.
[24] C.C. Wang,T.K. Truong,H.M. Shao,L.J. Deutsch,J.K. Omura, and I.S. Reed,"VLSI Architectures for Computing Multiplications and Inverses inGF(2m)," IEEE Trans. Computers, vol. 34, no. 8, pp. 709-716, Aug. 1985.
[25] H. Wu and M.A. Hasan, Efficient Exponentiation of a Primitive Root in$GF(2^m)$ IEEE Trans. Computers, vol. 46, no. 2, pp. 162-172, Feb. 1997.
[26] H. Wu and M.A. Hasan, "Low Complexity Bit-parallel Multipliers for a Class of Finite Fields," IEEE Trans. Computers, vol. 47, no. 8, pp. 883-887, Aug. 1998.
[27] H. Wu, M.A. Hasan, and I.F. Blake, New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases IEEE Trans. Computers, vol. 47, no. 11, pp. 1223-1233, Nov. 1998.

Index Terms:
Finite field, Massey-Omura multiplier, all-one polynomial, optimal normal bases
Citation:
A. Reyhani-Masoleh, M.A. Hasan, "A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})," IEEE Transactions on Computers, vol. 51, no. 5, pp. 511-520, May 2002, doi:10.1109/TC.2002.1004590