That quantum computers are bad news for RSA and discrete logarithms gave rise to post-quantum cryptography, which is now under consideration for standardisation by NIST, ETSI, ISO and the IETF. A natural question, then, is how quantum computers fare against these post-quantum schemes. Here, so far, the main application is Grover’s algorithm for various exhaustive search steps within classical cryptanalytic algorithms.

This workshop gave an overview of the use of quantum algorithms in cryptanalysis beyond Grover to encourage the broader exploration of quantum algorithms for cryptanalysis. The program is comprised of invited talks from expert speakers who have worked in the development of quantum algorithms and their application in cryptanalysis. The goal is a summer-school-like format and we strongly encourage audience participation.

Speakers / Schedule

08:30-09:30 Registration

09:30-10:30 Stacey Jeffery – Quantum Search Beyond Grover

10:30-11:00 Coffee Break

11:00-12:00 Yu-Ao Chen – Quantum Algorithms for Optimization over Finite Fields and Applications in Cryptanalysis

12:30-13:45 Lunch

13:45-14:45 André Schrottenloher – New Algorithms for Quantum Symmetric Cryptanalysis

14:45-15:45 Vlad Gheorghiu – Non-Asymptotic Quantum Resource Estimation

15:45-16:15 Coffee Break

16:15-17:15 Greg Kuperberg – Quantum Hidden Shift Algorithms 2.0