crypt@b-it 2010

Alexander May

Lattice-based Cryptanalysis

Abstract

Lattices are of great importance in the design and the analysis of
cryptographic algorithms. The most important algorithm is the so called
lattice basis reduction, which was invented by Lenstra, Lenstra and Lovasz in
1982 and revolutionized computational aspects of "the geometry of numbers",
leading to breakthroughs in cryptography and algorithmic number theory.

In the lecture we will discuss various cryptanalytic applications of lattices
such as attacks on low-exponent RSA or leading bits of a Diffie-Hellman
secret.

Material

Note that you can view additional material only if you are logged in.