On algorithms for solving Euclidean lattice problems in cryptography

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-SVP) and the lattice reduction algorithms as the best known solving algorithms so far. In particular, I will present an improved enumeration-based lattice reduction algorithm, which is shown to be (potentially) relevant to cryptanalysis. In the second part, we will instead consider a quantum problem that is computationally equivalent to approx-SVP. By directly solving a quantum problem, we may expect to have a more powerful use of the quantum computation. However, the best known algorithms for solving approx-SVP via solving this quantum problem, is not better than lattice reduction yet.

Le séminaire aura lieu en salle 16 et en ligne, et sera accessible à cette adresse:

https://webconf.lal.cloud.math.cnrs.fr/b/ann-dtn-6uw

Merci de respecter ces quelques règles de bienséance

- Connectez-vous quelques minutes en avance. La présentation commencera si possible à l'heure.
- Vous entrerez dans la salle en mode "muet". Merci de ne pas activer votre microphone avant la séance de questions, à l'issue de la présentation.
- Si possible, munissez-vous d'un casque afin d'éviter les échos lors des questions.
- Merci de ne pas activer votre webcam pendant l'exposé.