Elements of high order in finite fields specified by binomials
Victor Bovdi, Adama Diene, Roman Popovych

TL;DR
This paper presents explicit constructions of high-order elements in finite field extensions defined by binomials, improving previous bounds on element order for certain irreducible polynomials.
Contribution
It introduces two methods to explicitly construct elements with higher multiplicative order in finite fields defined by binomials, surpassing earlier bounds.
Findings
Elements with multiplicative order at least 5^{cube root of m/2} are constructed.
The methods improve bounds on element order in certain finite field extensions.
Explicit constructions are provided for elements in fields defined by x^m - a.
Abstract
Let be a field with elements, where is a power of a prime number . For any integer and such that the polynomial is irreducible in , we combine two different methods to construct explicitly elements of high order in the field . Namely, we find elements with multiplicative order of at least , which is better than previously obtained bound for such family of extension fields.
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 · Cryptography and Residue Arithmetic · Algebraic Geometry and Number Theory
