Skip to Main content Skip to Navigation
Conference papers

New algorithms for quantum (symmetric) cryptanalysis

Abstract : The security of symmetric cryptography is completely based on cryptanalysis: we only gain confidence in the security of a symmetric primitive through extensive and continuous scrutiny. It is therefore not possible to determine whether a symmetric primitive might be secure or not in a post-quantum world without first understanding how a quantum adversary could attack it. In this talk I will provide an overview of the subject and present some recent results on symmetric quantum cryptanalysis: a new efficient quantum collision search algorithm (joint work with A. Chailloux and M. Naya-Plasencia), and new efficient quantum algorithms for solving the K-xor problem (joint work with L. Grassi and M. Naya-Plasencia) and a very recent improvement that provides optimal merging algorithms. We will discuss some implications of these results in quantum-safe symmetric cryptography.
Document type :
Conference papers
Complete list of metadata
Contributor : André Schrottenloher <>
Submitted on : Tuesday, December 24, 2019 - 11:01:35 AM
Last modification on : Thursday, January 7, 2021 - 3:38:03 PM
Long-term archiving on: : Wednesday, March 25, 2020 - 12:57:52 PM


Files produced by the author(s)


  • HAL Id : hal-02423376, version 1



María Naya-Plasencia, André Schrottenloher, André Chailloux, Lorenzo Grassi. New algorithms for quantum (symmetric) cryptanalysis. QuAC: Quantum Algorithms for Cryptanalysis, May 2019, Darmstadt, Germany. ⟨hal-02423376⟩



Record views


Files downloads