Beyond Quadratic Speedups in Quantum Attacks on Symmetric Schemes

Bonnetain, Xavier; Schrottenloher, André; Sibleyras, Ferdinand

doi:10.1007/978-3-031-07082-2_12

Cited by 16 publications

(3 citation statements)

References 44 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Structured attacks with classical queries : It is now known that the structure exploited by some superposition attacks can also be exploited by attacks making only classical queries, that is, by a standard quantum attacker listening to today's classical communications. Though these attacks do not lead to polynomial‐time breaks, they allow one to obtain significantly better time‐memory tradeoffs [80] and a more‐than‐quadratic quantum time speedup on a key‐recovery attack [81]. We will now review the principle of the offline‐Simon algorithm, on which they are based.…”

Section: Symmetric Cryptographymentioning

confidence: 99%

“…In Ref. [81], the offline‐Simon algorithm was extended to target more constructions and in particular, constructions of the form:

x{\mapsto}{E}_{k}^{\prime }\left({k}_{2}\oplus {E}_{k}\left({k}_{1}\oplus x\right)\right),

with two independent block cipher calls keyed by k . Any classical key‐recovery attack requires time Ω(2 5 n /2 ), and the best attack requires also Ω(2 n /2 ) memory.…”

Section: Symmetric Cryptographymentioning

confidence: 99%

“…In Ref. [81], the offline-Simon algorithm was extended to target more constructions and in particular, constructions of the form:…”

mentioning

confidence: 99%

See 2 more Smart Citations

Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography

Biasse

Bonnetain

Kirshanova

et al. 2022

IET Information Security

View full text Add to dashboard Cite

In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post‐quantum secure cryptosystems. The authors provide details on the cost of the quantum algorithms presented in this survey. The authors furthermore discuss ongoing research directions that can impact quantum cryptanalysis in the future.

show abstract

Section: Symmetric Cryptographymentioning

confidence: 99%

“…In Ref. [81], the offline‐Simon algorithm was extended to target more constructions and in particular, constructions of the form:

x{\mapsto}{E}_{k}^{\prime }\left({k}_{2}\oplus {E}_{k}\left({k}_{1}\oplus x\right)\right),

with two independent block cipher calls keyed by k . Any classical key‐recovery attack requires time Ω(2 5 n /2 ), and the best attack requires also Ω(2 n /2 ) memory.…”