Construction of Irreducible Polynomials

Abstract

This chapter is devoted to the problem of constructing irreducible polynomials over a given finite field. Such polynomials are used to implement arithmetic in extension fields and are found in many applications, including coding theory [5], cryptography [13], computer algebra systems [11], multivariate polynomial factorization [21], and parallel polynomial arithmetic [18].