A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers [chapter]

Johannes Blömer, Alexander May
2005 Lecture Notes in Computer Science  
We present a new and flexible formulation of Coppersmith's method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximize the bound on the solutions of p(x, y) in a purely combinatorial way. We give various construction rules for different shapes of p(x, y)'s Newton polygon. Our method has several applications. Most interestingly, we reduce the case of solving univariate polynomials f (x) modulo some composite number N of unknown
more » ... ion to the case of solving bivariate polynomials over the integers. Hence, our approach unifies both methods given by Coppersmith at Eurocrypt 1996.
doi:10.1007/11426639_15 fatcat:uapgrebvpbctxay7x54f7bqtfm