1989, Willi Geiselmann, Dieter Gollmann, Symmetry and Duality in Normal Basis Multiplication, T. Mora (editor), Applied Algebra, Algebraic Algorithms, and Error-correcting Codes: 6th International Conference, Proceedings, Springer, LNCS 357, page 230,
12.3In thefinite field, find: (a) a primitive root of whose conjugates do not form a normal basis of ; (b) a normal basis that does not consist of primitive roots of .
For an arbitrary field with prime field , the extension does always have at least one normal basis consisting of primitive roots.
2015, Sergey Abrahamyan, Melsik Kyureghyan, New recursive construction of normal polynomials over finite fields, Gohar Kyureghyan, Gary L. Mullen, Alexander Pott (editors, Topics in Finite Fields, American Mathematical Society, page 1,
The set ofconjugatesofnormalelementis callednormal basis. Amonicirreducible polynomial is called normal or N-polynomial if its roots form a normal basis or, equivalently, if they are linearly independent over . The minimal polynomial of an element in a normal basis is which is irreducible over . The elements of a normal basis are exactly the roots of some N-polynomial. Hence an N-polynomial is just another way of describing a normal basis.