Beyond quadratic speedups in quantum attacks on symmetric schemes
From MaRDI portal
Publication:2170092
DOI10.1007/978-3-031-07082-2_12zbMath1502.81022arXiv2110.02836OpenAlexW3207012461MaRDI QIDQ2170092
Ferdinand Sibleyras, André Schrottenloher, Xavier Bonnetain
Publication date: 30 August 2022
Full work available at URL: https://arxiv.org/abs/2110.02836
quantum searchpost-quantum cryptographyquantum cryptanalysisSimon's algorithm2XOR-cascadekey-length extensionoffline-Simon
Searching and sorting (68P10) Quantum computation (81P68) Cryptography (94A60) Eta-invariants, Chern-Simons invariants (58J28) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94) Quantum gates (81P65)
Related Items
Quantum attacks on beyond-birthday-bound MACs ⋮ On the post-quantum security of classical authenticated encryption schemes ⋮ Quantum linear key-recovery attacks using the QFT
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On quantum slide attacks
- A construction of a cipher from a single pseudorandom permutation.
- Building quantum-one-way functions from block ciphers: Davies-Meyer and Merkle-Damgård constructions
- Quantum security of NMAC and related constructions. PRF domain extension against quantum attacks
- Grover meets Simon -- quantumly attacking the FX-construction
- Quantum key-recovery on full AEZ
- Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
- Tight bounds for Simon's algorithm
- Quantum cryptanalysis on contracting Feistel structures and observation on related-key settings
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations
- Quantum chosen-ciphertext attacks against Feistel ciphers
- Post-Quantum Security of the CBC, CFB, OFB, CTR, and XTS Modes of Operation
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2
- Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading
- Minimalism in Cryptography: The Even-Mansour Scheme Revisited
- Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys
- Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes
- Cryptanalytic Time-Memory-Data Tradeoffs for FX-Constructions with Applications to PRINCE and PRIDE
- Search via Quantum Walk
- The LED Block Cipher
- How to Protect DES Against Exhaustive Key Search
- A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
- Time/Space Trade-Offs for Reversible Computation
- Limitations of the Even-Mansour construction
- On the Power of Quantum Computation
- Forrelation: A Problem That Optimally Separates Quantum from Classical Computing
- Separations in Query Complexity Based on Pointer Functions
- Separations in query complexity using cheat sheets
- Quantum lower bounds by polynomials
- How to protect DES against exhaustive key search (an analysis of DESX).
- An optimal separation of randomized and Quantum query complexity
- k-forrelation optimally separates Quantum and classical query complexity
