Exploring Post-Quantum Cryptography & Quantum Algorithms for the Shortest Vector Problem 🔐

By André Chailloux (Inria Paris).


In this talk, André Chailloux will first briefly present the topic of post-quantum cryptography, what are its objectives and the current research questions associated to this topic. The hardness of the Shortest Vector Problem with respect to quantum computers is at the core of many post-quantum cryptographic schemes and it is therefore important to understand the best quantum algorithms for this problem. Chailloux will then present recent improvements on the best quantum algorithms for this problem, which is joint work with Johanna Loyer.

Webinar hosted by Universidad Politécnica de Madrid, as part of its Master in Quantum Computing Technology (https://www.quantum-explore.com)