A note on quantum related-key attacks
From MaRDI portal
Publication:458382
DOI10.1016/j.ipl.2014.08.009zbMath1358.94076arXiv1306.2301OpenAlexW2148184032MaRDI QIDQ458382
Rainer Steinwandt, Martin Roetteler
Publication date: 7 October 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.2301
Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability ⋮ Hidden shift quantum cryptanalysis and implications ⋮ Tight bounds for Simon's algorithm ⋮ Quantum cryptanalysis on contracting Feistel structures and observation on related-key settings ⋮ Quantum reversible circuit of AES-128 ⋮ Quantum differential and linear cryptanalysis ⋮ QCB is blindly unforgeable ⋮ Quantum circuit implementation and resource analysis of LBlock and LiCi ⋮ A quantum related-key attack based on the Bernstein-Vazirani algorithm ⋮ A quantum distinguisher for 7/8-round SMS4 block cipher ⋮ QCB: efficient quantum-secure authenticated encryption ⋮ Sponge-based authenticated encryption: security against quantum attackers ⋮ On quantum ciphertext indistinguishability, recoverability, and OAEP ⋮ Query complexity of generalized Simon's problem ⋮ Quantum indistinguishability for public key encryption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model
- Random Oracles in a Quantum World
- Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
- Introduction to post-quantum cryptography
- CHOSEN-KEY ATTACKS ON A BLOCK CIPHER
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Logical Reversibility of Computation
