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 Fq[Y]. © 1985.
Lenstra, A. K. (1985). Factoring multivariate polynomials over finite fields. Journal of Computer and System Sciences, 30(2), 235–248. https://doi.org/10.1016/0022-0000(85)90016-9