doi
10.1007/978-3-030-38471-5_20
SPN
bar
composition
et al
types
slide attack
al
chapter
queries
algorithm
new results
false
possibility
2020-01-10
twist
cipher
quantum algorithms
2022-12-01T06:46
cases
superposition model
surprising new result
construction
technique
above variants
Kaplan et al
quantum attacks
chapters
Simon’s algorithm
model
round function
cryptanalysis techniques
attacks
slides
exponential acceleration
https://scigraph.springernature.com/explorer/license/
XOR operation
function
query model
acceleration
Feistel ciphers
At Crypto 2016, Kaplan et al. proposed the first quantum exponential acceleration of a classical symmetric cryptanalysis technique: they showed that, in the superposition query model, Simon’s algorithm could be applied to accelerate the slide attack on the alternate-key cipher. This allows to recover an n-bit key with \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\mathop {}\mathopen {}\mathcal {O}\mathopen {}\left( n\right) $$\end{document} queries.In this paper we propose many other types of quantum slide attacks, inspired by classical techniques including sliding with a twist, complementation slide and mirror slidex. We also propose four-round self-similarity attacks for Feistel ciphers when using XOR operations. Some of these variants combined with whitening keys (FX construction) can also be successfully attacked. We present a surprising new result involving composition of quantum algorithms, that allows to combine some quantum slide attacks with a quantum attack on the round function, allowing an efficient key-recovery even if this function is strong classically.Finally, we analyze the case of quantum slide attacks exploiting cycle-finding, whose possibility was mentioned in a paper by Bar-On et al. in 2015, where these attacks were introduced. We show that the speed-up is smaller than expected and less impressive than the above variants, but nevertheless provide improved complexities on the previous known quantum attacks in the superposition model for some self-similar SPN and Feistel constructions.
variants
n-bit key
CRYPTO 2016
492-519
classical techniques
2020-01-10
https://doi.org/10.1007/978-3-030-38471-5_20
complexity
results
key
operation
Slidex
paper
Feistel construction
On Quantum Slide Attacks
978-3-030-38471-5
Selected Areas in Cryptography – SAC 2019
978-3-030-38470-8
Kenneth G.
Paterson
María
Naya-Plasencia
Bonnetain
Xavier
pub.1123979149
dimensions_id
Collège Doctoral, Sorbonne Université, 75005, Paris, France
Inria, Paris, France
Inria, Paris, France
Stebila
Douglas
Quantum Physics
André
Schrottenloher
Physical Sciences
Springer Nature - SN SciGraph project
Springer Nature