English

Iterative constructions of irreducible polynomials from isogenies

Number Theory 2023-11-07 v3

Abstract

Let SS be a rational fraction and let ff be a polynomial over a finite field. Consider the transform T(f)=numerator(f(S))T(f)=\operatorname{numerator}(f(S)). In certain cases, the polynomials ff, T(f)T(f), T(T(f))T(T(f))\dots are all irreducible. For instance, in odd characteristic, this is the case for the rational fraction S=(x2+1)/(2x)S=(x^2+1)/(2x), known as the RR-transform, and for a positive density of all irreducible polynomials ff. We interpret these transforms in terms of isogenies of elliptic curves. Using complex multiplication theory, we devise algorithms to generate a large number of other rational fractions SS, each of which yields infinite families of irreducible polynomials for a positive density of starting irreducible polynomials ff.

Keywords

Cite

@article{arxiv.2302.09674,
  title  = {Iterative constructions of irreducible polynomials from isogenies},
  author = {Alp Bassa and Gaetan Bisson and Roger Oyono},
  journal= {arXiv preprint arXiv:2302.09674},
  year   = {2023}
}