An Algorithm for Finding Small Roots of Multivariate Polynomials over the Integers.
Domingo Gómez‐Pérez, Jaime Gutiérrez, Álvar Ibeas · 2007
Abstract. In this paper we present a new algorithm for finding small roots of multivariate polynomials over the integers based on lattice reduction techniques. Our simpler heuristic method is inspired in algorithms for predicting pseudorandom numbers, and it can be considered as another variant of Coppersmith’s method for finding small solutions of integer bivariate polynomials. We also apply the method to the problem of factoring an integer when we know the high-order bits of one of the factors. 1