New results on symmetric quantum cryptanalysis - Archive ouverte HAL Access content directly
Conference Papers Year :

New results on symmetric quantum 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 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.
Fichier principal
Vignette du fichier
Crossfyre18_Naya.pdf (655.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01953997 , version 1 (13-12-2018)


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


45 View
44 Download


Gmail Facebook Twitter LinkedIn More