Skip to Main content Skip to Navigation
Conference papers

New results on symmetric quantum 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 A. Schrottenloher), and new efficient quantum algorithms for solving the K-xor problem (joint work with L. Grassi and A. Schrottenloher). We will discuss some implications of these results in quantum-safe symmetric cryptography.
Document type :
Conference papers
Complete list of metadata
Contributor : María Naya-Plasencia Connect in order to contact the contributor
Submitted on : Thursday, December 13, 2018 - 4:50:54 PM
Last modification on : Thursday, January 7, 2021 - 3:38:03 PM
Long-term archiving on: : Thursday, March 14, 2019 - 2:14:34 PM


Files produced by the author(s)


  • HAL Id : hal-01953997, version 1



María Naya-Plasencia. New results on symmetric quantum cryptanalysis. Crossfyre 2018 - 8th international workshop on cryptography, robustness, and provably secure schemes for female young researchers, Sep 2018, Surrey, United Kingdom. ⟨hal-01953997⟩



Record views


Files downloads