High Order Elements in Finite Fields Arising from Recursive Towers

DOI10.1007/S10623-022-01041-3MaRDI QIDQ6349639arXivWikidataFDO

Authors Valerio Dose, Pietro Mercuri, Ankan Pal, Claudio Stirpe

Publication date 22 September 2020

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10623-022-01041-3

Mathematics Subject Classification ID

Arithmetic theory of polynomial rings over finite fields (11T55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

arXiv classification

math.NT

Abstract: We provide a recipe to construct towers of fields producing high order elements in $mathrmGF(q,2^n)$, for odd $q$, and in $mathrmGF(2,2cdot{3}^n)$, for $nge1$. These towers are obtained recursively by $x_n^2+x_n=v(x_{n-1})$, for odd $q$, or $x_n^3+x_n=v(x_{n-1})$, for $q=2$, where $v(x)$ is a polynomial of small degree over the prime field $mathrmGF(q,1)$ and $x_n$ belongs to the finite field extension $mathrmGF(q,2^n)$, for $q$ odd, or to $mathrmGF(2,2cdot{3}^n)$. Several examples are carried out and analysed numerically. The lower bounds of the orders of the groups generated by $x_n$, or by the discriminant $delt{a}_n$ of the polynomial, are similar to the ones obtained in [BCG+09], but we get better numerical results in some cases.

This page was built for publication: High Order Elements in Finite Fields Arising from Recursive Towers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6349639)