A low-complexity Multiplication over GF(2m) and multiplier circuit has been proposed by using cyclic-shift coefficients and the irreducible trinomial. The proposed circuit has the parallel input/output architecture and shows the lower-complexity than ...
A low-complexity Multiplication over GF(2m) and multiplier circuit has been proposed by using cyclic-shift coefficients and the irreducible trinomial. The proposed circuit has the parallel input/output architecture and shows the lower-complexity than others with the characteristics of the cyclic-shift coefficients and the irreducible trinomial modular computation. The proposed multiplier is composed of 2m<SUP>2</SUP>-input AND gates and m·(m+2) 2-input XOR gates without the memories and switches. And the minimum propagation delay is T<SUB>A</SUB>+(2+log<SUB>2</SUB>m)T<SUB>X</SUB>. The Proposed circuit architecture is well suited to VLSI implementation because it is simple, regular and modular.