Coppersmith method

(mathematics, cryptography) A method of finding small integer zeros of univariate or bivariate polynomials modulo a given integer. It forms the basis of Coppersmith's attack.