On Solving Number Theoretic Problems with Lattice Reduction

Alexander May
Technishche Universtitat Darmstadt

We review several attacks on public-key cryptosystems with lattice reduction techniques. More precisely, we discuss the applicability and limits of a lattice-based method for finding small roots of multivariate polynomial equations. Among the applications, we present relaxed versions of the factorization problem and the problem of taking roots modulo composite integers of unknown factorization.

Audio (MP3 File, Podcast Ready) Presentation (PDF File)

Back to Workshop I: Number Theory and Cryptography - Open Problems