Finding Small Roots of Bivariate Integer Polynomial Equations Revisited

At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is difficult to understand. In this paper, we present a much simpler algorithm for solving the same problem. Our simplification is analogous to the simplification brought by Howgrave-Graham to Coppersmith’s algorithm for finding small roots of univariate modular polynomial equations. As an application, we illustrate the new algorithm with the problem of finding the factors of n = pq if we are given the high order 1/4 log2 n bits of p.

• Type: Conference
• Year: 2004
• Where: EUROCRYPT
• Authors: Jean-Sébastien Coron
• Keywords: Algorithm, Cryptography, EUROCRYPT 2004, Polynomial Equations, Small Roots