Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields

We present a probabilistic algorithm that finds the irreducible factors of a bivariate polynomial with coefficients from a finite field in time polynomial in the input size, i.e. in the degree of the polynomial and log (cardinality of field). The algorithm generalizes to multivariate polynomials and has polynomial running time for densely encoded inputs. Also a deterministic version of the algorithm is discussed whose running time is polynomial in the degree of the input polynomial and the size of the field.