Low-complexity bit-parallel canonical and normal basis multipliersfor a class of finite fields

摘要

We present a new low-complexity bit-parallel canonical basismultiplier for the field GF(2m) generated by anall-one-polynomial. The proposed canonical basis multiplier requires m2-1 XOR gates and m2 AND gates. We also extendthis canonical basis multiplier to obtain a new bit-parallel normalbasis multiplier