Factoring multivariate polynomials over finite fields

Arjen K. Lenstra
1983 Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83  
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 IF<J [ Y].
doi:10.1145/800061.808748 dblp:conf/stoc/Lenstra83 fatcat:q4datcnp5vha5lovuoxbwksmlm