Constructing irreducible polynomials over finite fields

San Ling, Enver Ozdemir, Chaoping Xing
2012 Mathematics of Computation  
We describe a new method for constructing irreducible polynomials modulo a prime number p. The method mainly relies on Chebotarev's density theorem.
doi:10.1090/s0025-5718-2011-02567-6 fatcat:t3jyp5kj2nduffdsqezbb4hpka