The Community for Technology Leaders
Green Image
<p>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.</p>
Finite field, Massey-Omura multiplier, all-one polynomial, optimal normal bases

A. Reyhani-Masoleh and M. Hasan, "A New Construction of Massey-Omura Parallel Multiplier over GF(2^{m})," in IEEE Transactions on Computers, vol. 51, no. , pp. 511-520, 2002.
95 ms
(Ver 3.3 (11022016))