Key function of normal basis multipliers in GF (2 n )
Haining Fan, Yiqi Dai · Electronics Letters · 2002
A new definition of the key function in GF(2n) is given. Based on this definition, a method to speed up software implementations of the normal basis multiplication is presented. It is also shown that the normal basis with maximum complexity can be used to design low complexity multipliers. In particular, it is shown that the circuit complexity of a type I optimal normal basis multiplier can be further reduced.