Institut de recherche mathématique de Rennes
IRMAR - UMR CNRS 6625
Vous êtes ici
In this talk, we will try to review the state-of-the-art of the algorithms for solving the Euclidean lattice problems underlying cryptography. In more details, this talk contains two parts. In the first part, we will focus on the lattice problems such as approximate Shortest Vector Problem (approx-...
Salle 016, campus de Beaulieu, Rennes