Title :
Key function of normal basis multipliers in GR(2n)
Author :
Fan, Haining ; Dai, Yiqi
Author_Institution :
Dept. of Comput. Sci., Tsinghua Univ., Beijing, China
fDate :
11/7/2002 12:00:00 AM
Abstract :
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.
Keywords :
Galois fields; circuit complexity; multiplying circuits; Galois fields; circuit complexity; key function; low complexity multiplier design; maximum complexity; software implementation; type I optimal normal basis multiplier;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:20020960
