On the complexity of the dual basis of a type I optimal normal basis

Authors:
Zhe-Xian Wan;Kai Zhou
Affiliations:
Academy of Mathematics and Systems Science, Chinese Academy of Sciences, 100080 Beijing, China;Academy of Mathematics and Systems Science, Chinese Academy of Sciences, 100080 Beijing, China
Venue:
Finite Fields and Their Applications
Year:
2007

Citing 1
Cited 4

Low complexity normal bases in F2n

Finite Fields and Their Applications

The trace of an optimal normal element and low complexity normal bases

Designs, Codes and Cryptography
Gauss periods as constructions of low complexity normal bases

Designs, Codes and Cryptography
Elliptic periods for finite fields

Finite Fields and Their Applications
Low complexity of a class of normal bases over finite fields

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complexity of the dual of a type I optimal normal basis of F"q"^"n over F"q is computed to be either 3n-3 or 3n-2 according as q is even or odd, respectively. A partial converse of this result is also obtained.