Factoring multivariate polynomials over finite fields
Arjen K. Lenstra · 1983
This paper describes an algorithm for the factorization of multivariate polynomials with coefficients in a finite field that is polynomial-time in the degrees of the polynomial to be factored. The algorithm makes use of a new basis reduction algorithm for lattices over IFq.