Abstract. This talk is a brief survey of recent results and ideas concern-ing the problem of finding a mall root of a univariate polynomial mod N, and the companion problem of finding a small solution to a bivariate equation over Z. We start with the lattice-based approach from [2],[3], and speculate on directions for improvement.
Keywords: Modular polynomials, lattice reduction
By: Don Coppersmith
Published in: Lecture Notes in Computer Science, volume 2146, (no ), pages 20-31 in 2001
Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.
Questions about this service can be mailed to reports@us.ibm.com .