Low complexity bit-parallel multipliers for GF(2 m )with generator polynomial x m + x k + 1
Michele Elia, M. Leone, C. Visentin · Electronics Letters · 1999
A low complexity bit-parallel standard basis multiplier for GF(2m) with polynomial generator xm + xk + 1 is presented. The proposed multiplier uses a significantly smaller number of XOR/AND gates than the fastest known multipliers, while having a comparable logarithmic computing time.