New algorithms for quantum (symmetric) cryptanalysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

New algorithms for quantum (symmetric) cryptanalysis


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.
Fichier principal
Vignette du fichier
quac-2019-slides.pdf (883.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02423376 , version 1 (24-12-2019)


  • 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⟩


188 View
68 Download


Gmail Facebook X LinkedIn More