Cryptography and Lattices

Volume 2146 of the series Lecture Notes in Computer Science pp 20-31


Finding Small Solutions to Small Degree Polynomials

  • Don CoppersmithAffiliated withIBM Research, T.J. Watson Research Center

* Final gross prices may vary according to local VAT.

Get Access


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 finding a small solution to a bivariate equation over ℤ. We start with the lattice-based approach from [2,3], and speculate on directions for improvement.


Modular polynomials lattice reduction