A new proof to the complexity of the dual basis of a type I optimal normal basis

The complexity of dual basis of a type I optimal normal basis of $\mathbb{F}_{q^n}$ over $\mathbb{F}_{q}$ was determined to be $3n-3$ or $3n-2$ according as $q$ is even or odd, respectively, by Z.-X. Wan and K. Zhou in 2007. We give a new proof to this result by clearly deriving the dual of a type I optimal normal basis with the aid of a lemma on the dual of a polynomial basis.

[1]  Zhe-Xian Wan,et al.  On the complexity of the dual basis of a type I optimal normal basis , 2007, Finite Fields Their Appl..

[2]  A. Menezes,et al.  Applications of Finite Fields , 1992 .

[3]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.