We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2m) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m2-1 XOR gates and m2 AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier
Published in:
Computers, IEEE Transactions on
(Volume:47
,
Issue:
3
)
Date of Publication: Mar 1998