4 search results - page 1 / 1 » Finding Small Roots of Bivariate Integer Polynomial Equation... |
EUROCRYPT
2004
Springer
13 years 9 months ago
2004
Springer
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...
CRYPTO
2007
Springer
13 years 10 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
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 maximiz...
CALC
2001
Springer
13 years 8 months ago
2001
Springer
Abstract. This talk is a brief survey of recent results and ideas concerning the problem of finding a small root of a univariate polynomial mod N, and the companion problem of fi...