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 an extensive analysis of the use of modular additions on symmetric primitives (joint work with X. Bonnetain). We will discuss some implications of these results in quantum-safe symmetric cryptography.
Document type :
Documents associated with scientific events
Complete list of metadatas

https://hal.inria.fr/hal-01954616
Contributor : María Naya-Plasencia <>
Submitted on : Thursday, December 13, 2018 - 5:35:53 PM
Last modification on : Saturday, December 15, 2018 - 1:17:53 AM
Long-term archiving on: Thursday, March 14, 2019 - 3:51:30 PM

File

CCA-QC (9).pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01954616, version 1

Collections

Citation

María Naya-Plasencia. New results on symmetric quantum cryptanalysis. Seminaire CCA, Mar 2018, Paris, France. ⟨hal-01954616⟩

Share

Metrics

Record views

26

Files downloads

40