A New Construction of Massey-Omura Parallel Multiplier over GF(2m)

The Massey-Omura multiplier of GF(2/sup 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 multiplier contain redundancy in that special class of finite fields, but it also has redundancy in fields GF(2/sup 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]  Christof Paar,et al.  A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields , 1996, IEEE Trans. Computers.

[2]  Vijay K. Bhargava,et al.  Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2^m) , 1992, IEEE Trans. Computers.

[3]  Edoardo D. Mastrovito,et al.  VLSI Designs for Multiplication over Finite Fields GF (2m) , 1988, AAECC.

[4]  Ronald C. Mullin,et al.  Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..

[5]  Michele Elia,et al.  Low Complexity Bit-Parallel Multipliers for GF(2^m) with Generator Polynomial x^m+x^k+1 , 1999 .

[6]  Toshiya Itoh,et al.  Structure of Parallel Multipliers for a Class of Fields GF(2^m) , 1989, Inf. Comput..

[7]  Çetin Kaya Koç,et al.  Mastrovito Multiplier for General Irreducible Polynomials , 2000, IEEE Trans. Computers.

[8]  Thomas Beth,et al.  Arithmetic Operations in GF(2 m ). , 1993 .

[9]  Shuhong Gao,et al.  Optimal normal bases , 1992, Des. Codes Cryptogr..

[10]  Christof Paar,et al.  Efficient Multiplier Architectures for Galois Fields GF(2 4n) , 1998, IEEE Trans. Computers.

[11]  Çetin Kaya Koç,et al.  Mastrovito Multiplier for General Irreducible Polynomials , 1999, IEEE Trans. Computers.

[12]  M.A. Hasan,et al.  New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases , 1998, IEEE Trans. Computers.

[13]  Germain Drolet,et al.  A New Representation of Elements of Finite Fields GF(2m) Yielding Small Complexity Arithmetic Circuits , 1998, IEEE Trans. Computers.

[14]  Mohammed Benaissa,et al.  GF(2^m) Multiplication and Division Over the Dual Basis , 1996, IEEE Trans. Computers.

[15]  H. Niederreiter,et al.  Introduction to finite fields and their applications: Factorization of Polynomials , 1994 .

[16]  Trieu-Kien Truong,et al.  A Comparison of VLSI Architecture of Finite Field Multipliers Using Dual, Normal, or Standard Bases , 1988, IEEE Trans. Computers.

[17]  Ian F. Blake,et al.  Low complexity normal bases , 1989, Discret. Appl. Math..

[18]  A. Menezes,et al.  Applications of Finite Fields , 1992 .

[19]  Berk Sunar,et al.  Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields , 1998, IEEE Trans. Computers.

[20]  Chin-Liang Wang,et al.  Systolic Array Implementation o Euclid's Algorithm for Inversion and Division in GF(2m) , 1998, IEEE Trans. Computers.

[21]  Berk Sunar,et al.  Mastrovito Multiplier for All Trinomials , 1999, IEEE Trans. Computers.

[22]  M. Anwar Hasan,et al.  Efficient Exponentiation of a Primitive Root in GF(2^m) , 1997, IEEE Trans. Computers.

[23]  Trieu-Kien Truong,et al.  VLSI Architectures for Computing Multiplications and Inverses in GF(2m) , 1983, IEEE Transactions on Computers.

[24]  V.K. Bhargava,et al.  A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields , 1993, IEEE Trans. Computers.