Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite FieldsC. K. Koc and B. SunarProceedings of 1998 IEEE International Symposium on Information Theory, pages 294-294, MIT, Cambridge, Massachusetts, August 16-21, 1998.AbstractWe 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. |