New GF(2n) Parallel Multiplier Using Redundant Representation.
Haining Fan, Yiqi Dai · 2004
A new GF(2 ) redundant representation is presented. Squaring in the representation is almost cost-free. Based on the representation, two multipliers are proposed. The XOR gate complexity of the first multiplier is lower than a recently proposed normal basis multiplier when C N (the complexity of the basis) is larger than 3n-1.