The trace of primitive and $2$-primitive elements in finite fields, revisited
Stephen D. Cohen, Giorgos Kapetanakis

TL;DR
This paper revisits and refines previous results on the existence of primitive and 2-primitive elements in finite fields with prescribed trace, providing exact counts and correcting earlier errors.
Contribution
It amends prior proofs by reducing problems to prime degree extensions and deriving exact formulas for squares with prescribed trace in finite fields.
Findings
Corrected proof for the existence of primitive and 2-primitive elements with prescribed trace
Derived an exact expression for counting squares with a given trace in finite fields
Streamlined computational methods for these problems
Abstract
By definition primitive and -primitive elements of a finite field extension have order and , respectively. We have already shown that, with minor reservations, there exists a primitive element and a -primitive element with prescribed trace in the ground field . Here we amend our previous proofs of these results, firstly, by a reduction of these problems to extensions of prime degree and, secondly, by deriving an exact expression for the number of squares in whose trace has prescribed value in . The latter corrects an error in the proof in the case of -primitive elements. We also streamline the necessary computations.
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
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
