Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields

C. K. Koc and B. Sunar

IEEE Transactions on Computers, 47(3):353-356, March 1998.

Abstract

We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2^m) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m^2-1 XOR gates and m^2 AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier.