A Note on the Bivariate Coppersmith Theorem
In 1997, Coppersmith proved a famous theorem for finding small roots of bivariate polynomials over a"currency sign, with important applications to cryptography. While it seems to have been overlooked until now, we found the proof of the most commonly cited version of this theorem to be incomplete. Filling in the gap requires technical manipulations which we carry out in this paper.
small roots bivariate polynomials coppersmith's theorem