Skip to Main content Skip to Navigation

Quantum Algorithms for Cryptanalysis and Quantum-safe Symmetric Cryptography

Abstract : Modern cryptography relies on the notion of computational security. The level of security given by a cryptosystem is expressed as an amount of computational resources required to break it. The goal of cryptanalysis is to find attacks, that is, algorithms with lower complexities than the conjectural bounds.With the advent of quantum computing devices, these levels of security have to be updated to take a whole new notion of algorithms into account. At the same time, cryptography is becoming widely used in small devices (smart cards, sensors), with new cost constraints.In this thesis, we study the security of secret-key cryptosystems against quantum adversaries.We first build new quantum algorithms for k-list (k-XOR or k-SUM) problems, by composing exhaustive search procedures. Next, we present dedicated cryptanalysis results, starting with a new quantum cryptanalysis tool, the offline Simon's algorithm. We describe new attacks against the lightweight algorithms Spook and Gimli and we perform the first quantum security analysis of the standard cipher AES.Finally, we specify Saturnin, a family of lightweight cryptosystems oriented towards post-quantum security. Thanks to a very similar structure, its security relies largely on the analysis of AES.
Document type :
Complete list of metadata
Contributor : ABES STAR :  Contact
Submitted on : Thursday, January 27, 2022 - 1:02:28 PM
Last modification on : Wednesday, June 8, 2022 - 12:50:08 PM


Version validated by the jury (STAR)


  • HAL Id : tel-03142366, version 2


André Schrottenloher. Quantum Algorithms for Cryptanalysis and Quantum-safe Symmetric Cryptography. Cryptography and Security [cs.CR]. Sorbonne Université, 2021. English. ⟨NNT : 2021SORUS271⟩. ⟨tel-03142366v2⟩



Record views


Files downloads