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

@article{Wan2007OnTC,
  title={On the complexity of the dual basis of a type I optimal normal basis},
  author={Zhe-Xian Wan and Kai Zhou},
  journal={Finite Fields and Their Applications},
  year={2007},
  volume={13},
  pages={411-417}
}
The complexity of the dual of a type I optimal normal basis of Fqn over Fq 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. © 2005 Elsevier Inc. All rights reserved.