Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
Çetin Kaya Koç, Berk Sunar · IEEE Transactions on Computers · 1998
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 m/sup 2/-1 XOR gates and m/sup 2/ AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier.