Abstract

The main result of this paper is a new algorithm for constructing an irreducible polynomial of specified degree n over a finite field F q . The algorithm is probabilistic, and is asymptotically faster than previously known algorithms for this problem. It uses an expected number of O~(n 2 + n log q) operations in F q , where the "soft-O" O~ indicates an implicit factor of (log n) O(1) . In addition, two new polynomial irreducibility tests are described. 1 Introduction 1.1 Statement of main result Let F q be a finite field with q elements, where q is a prime-power. A theorem due to Moore (1893) states that for every positive integer n, there exists a field extension F q n , unique up to isomorphism, with q n elements. Such extensions play an important role in coding theory (implementing error correcting codes), cryptography (implementing cryptosystems), and complexity theory (amplifying randomness). In this paper, we consider the algorithmic version of Moore's theorem: how to ...

Citations

2172	The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
693	Matrix multiplication via arithmetical progressions - Coppersmith, Winograd - 1990
446	Finite fields - Lidl, Niederreiter - 1997
348	zur Gathen and - von - 1999
238	Simple Constructions of Almost k-wise Independent Random Variables - Alon, Goldreich, et al. - 1990
127	On fast multiplication of polynomials over arbitrary algebras - Cantor, Kaltofen - 1991
112	Fast solution of Toeplitz systems of equations and computation of Padé approximations - Brent, Gustavson, et al. - 1980
73	Probabilistic algorithms in finite fields - Rabin - 1980
55	New algorithms for finding irreducible polynomials over finite fields - Shoup - 1990
43	Solving systems of nonlinear polynomial equations faster - F, Kaltofen, et al. - 1989
40	Probabilistic algorithms in finite fields - Ben-Or - 1981
9	Improving the time complexity of the computation of irreducible and primitive polynomials in finite fields - Rifà, Borrell - 1991
6	Jr, Finding irreducible polynomials over finite fields, STOC - Adleman, Lenstra - 1986
5	On the reducibility of polynomials over a finite field - Butler - 1954
4	Construction of irreducible polynomials over finite fields with linearly independent roots - Semaev - 1988
3	zur Gathen. Tests for permutation polynomials - von - 1991
2	The complexity of computing partial derivatives - Baur, Strassen - 1983
2	Polynomial time construction of a finite field - Chistov - 1984
2	A doubly-infinite system of simple groups - Moore
1	Sur la th'eorie des nombres - Galois