Computational Results on the Existence of Primitive Complete Normal Basis Generators
Dirk Hachenberger, Stefan Hackenberg

TL;DR
This paper provides computational evidence supporting a longstanding conjecture that in Galois field extensions, primitive elements that are completely normal over the base field always exist.
Contribution
The authors offer computational results that strongly support Morgan and Mullen's conjecture regarding primitive completely normal basis generators in Galois fields.
Findings
Computational results support the conjecture for various Galois extensions.
Evidence suggests the universal existence of primitive completely normal elements.
Supports the conjecture's validity across multiple cases.
Abstract
We present computational results which strongly support a conjecture of Morgan and Mullen (1996), which states that for every extension of Galois fields there exists a primitive element of which is completely normal over .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Coding theory and cryptography · Polynomial and algebraic computation
