Generators and irreducible polynomials over finite fields
Open Access
- 1 July 1997
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 66 (219) , 1195-1212
- https://doi.org/10.1090/s0025-5718-97-00835-1
Abstract
Weil’s character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite field. An application to the distribution of irreducible polynomials is given, which confirms an asymptotic version of a conjecture of Hansen-Mullen.Keywords
This publication has 13 references indexed in Scilit:
- The coefficients of primitive polynomials over finite fieldsMathematics of Computation, 1996
- Factor RefinementJournal of Algorithms, 1993
- Primitive Polynomials Over Finite FieldsMathematics of Computation, 1992
- Character sums and abelian Ramanujan graphsJournal of Number Theory, 1992
- Searching for Primitive Roots in Finite FieldsMathematics of Computation, 1992
- Finding Isomorphisms Between Finite FieldsMathematics of Computation, 1991
- Primitive elements and polynomials with arbitrary traceDiscrete Mathematics, 1990
- Diameters and EigenvaluesJournal of the American Mathematical Society, 1989
- An Estimate for Character SumsJournal of the American Mathematical Society, 1989
- Primitive Normal Bases for Finite FieldsMathematics of Computation, 1987