Universality for low degree factors of random polynomials over finite fields
Jimmy He, Huy Tuan Pham, Max Wenqiang Xu

TL;DR
This paper demonstrates that the distribution of low degree irreducible factors of random polynomials over finite fields exhibits universality, similar to uniform polynomials, using Fourier analysis and recent equidistribution tools.
Contribution
It extends universality results to non-uniform coefficients and multiple roots, employing Fourier analysis and recent equidistribution techniques.
Findings
Distribution of low degree factors matches that of uniform polynomials
Universality holds under certain parameter conditions, including prime fields with size up to exponential in degree
Methods extend to handle multiple roots and Hasse derivatives
Abstract
We show that the counts of low degree irreducible factors of a random polynomial over with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for random polynomials over finite fields. Our strongest results require various assumptions on the parameters, but we are able to obtain results requiring only a prime with where is the degree of the polynomial. Our proofs use Fourier analysis, and rely on tools recently applied by Breuillard and Varj\'u to study the process, which show equidistribution for at a single point. We extend this to handle multiple roots and the Hasse derivatives of , which allow us to study the irreducible factors with multiplicity.
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 · Analytic Number Theory Research · Cryptography and Residue Arithmetic
