Springer Nature - SN SciGraph project
Steven
Galbraith
paper
FX construction
FSE
previous results
chapter
concrete estimates
time
Kuperberg
cryptanalysis
bitwise addition
new algorithm
thanks
modular addition
estimates
follow
security
TWEAK
analysis
https://doi.org/10.1007/978-3-030-03326-2_19
cost
2018-10-27
concrete parameters
superposition model
https://scigraph.springernature.com/explorer/license/
addition
first time
2022-12-01T06:48
problem
Hidden Shift Quantum Cryptanalysis and Implications
model
560-592
chapters
algorithm
quantum algorithms
At Eurocrypt 2017 a tweak to counter Simon’s quantum attack was proposed: replace the common bitwise addition with other operations, as a modular addition. The starting point of our paper is a follow up of these previous results:First, we have developed new algorithms that improves and generalizes Kuperberg’s algorithm for the hidden shift problem, which is the algorithm that applies instead of Simon when considering modular additions. Thanks to our improved algorithm, we have been able to build a quantum attack in the superposition model on Poly1305, proposed at FSE 2005, widely used and claimed to be quantumly secure. We also answer an open problem by analyzing the effect of the tweak to the FX construction.We have also generalized the algorithm. We propose for the first time a quantum algorithm for solving the hidden problem with parallel modular additions, with a complexity that matches both Simon and Kuperberg in its extremes.In order to verify our theoretical analysis, and to get concrete estimates of the cost of the algorithms, we have simulated them, and were able to validate our estimated complexities.Finally, we analyze the security of some classical symmetric constructions with concrete parameters, to evaluate the impact and practicality of the proposed tweak. We concluded that the tweak does not seem to be efficient.
implications
results
quantum attacks
attacks
symmetric construction
construction
parameters
open problem
quantum cryptanalysis
extremes
point
Simon
true
operation
Eurocrypt
starting point
2018-10-27
effect
complexity
impact
order
shift problem
improved algorithm
Poly1305
practicality
theoretical analysis
Inria, Paris, France
Sorbonne Université, Collège Doctoral, F-75005, Paris, France
Inria, Paris, France
978-3-030-03325-5
978-3-030-03326-2
Advances in Cryptology – ASIACRYPT 2018
Xavier
Bonnetain
Peyrin
Thomas
María
Naya-Plasencia
Computation Theory and Mathematics
pub.1107870546
dimensions_id
doi
10.1007/978-3-030-03326-2_19
Springer Nature
Information and Computing Sciences