Abstract: In a basic related-key attack against a block cipher, the adversary has access to encryptions under keys that differ from the target key by bit-flips. In this short note we show that for a quantum adversary such attacks are quite powerful: if the secret key is (i) uniquely determined by a small number of plaintext-ciphertext pairs, (ii) the block cipher can be evaluated efficiently, and (iii) a superposition of related keys can be queried, then the key can be extracted efficiently.
Recommendations
- A quantum related-key attack based on the Bernstein-Vazirani algorithm
- Quantum attacks on public-key cryptosystems
- scientific article
- On quantum related-key attacks on iterated Even-Mansour ciphers
- A note on quantum security for post-quantum cryptography
- Attacks on fixed apparatus quantum key distribution schemes
- Attacks on quantum key distribution protocols that employ non-ITS authentication
- Analysis of attacks onto quantum public key distribution system
- Information Security and Cryptology
- Restricted attacks on semi-quantum key distribution protocols
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3930877 (Why is no real title available?)
- scientific article; zbMATH DE number 166085 (Why is no real title available?)
- scientific article; zbMATH DE number 2009976 (Why is no real title available?)
- scientific article; zbMATH DE number 1759272 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 1406124 (Why is no real title available?)
- A logarithmic-depth quantum carry-lookahead adder
- CHOSEN-KEY ATTACKS ON A BLOCK CIPHER
- Introduction to post-quantum cryptography
- Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
- Logical Reversibility of Computation
- On cipher-dependent related-key attacks in the ideal-cipher model
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum addition circuits and unbounded fan-out
- Random oracles in a quantum world
Cited in
(21)- Sponge-based authenticated encryption: security against quantum attackers
- A quantum distinguisher for 7/8-round SMS4 block cipher
- Breaking the Quadratic Barrier: Quantum Cryptanalysis of Milenage, Telecommunications’ Cryptographic Backbone
- QCB: efficient quantum-secure authenticated encryption
- Quantum reversible circuit of AES-128
- On quantum ciphertext indistinguishability, recoverability, and OAEP
- Hidden shift quantum cryptanalysis and implications
- Tight bounds for Simon's algorithm
- Quantum attacks against iterated block ciphers
- QCB is blindly unforgeable
- Query complexity of generalized Simon's problem
- Quantum indistinguishability for public key encryption
- A quantum related-key attack based on the Bernstein-Vazirani algorithm
- On quantum related-key attacks on iterated Even-Mansour ciphers
- scientific article; zbMATH DE number 5320301 (Why is no real title available?)
- On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on Separability
- Grover meets Simon -- quantumly attacking the FX-construction
- Quantum differential and linear cryptanalysis
- Key distribution. I: Quantum menace
- Quantum cryptanalysis on contracting Feistel structures and observation on related-key settings
- Quantum circuit implementation and resource analysis of LBlock and LiCi
This page was built for publication: A note on quantum related-key attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458382)
