Improvements to quantum search techniques for block-ciphers, with applications to AES
From MaRDI portal
Publication:832355
DOI10.1007/978-3-030-81652-0_14zbMATH Open1485.94078OpenAlexW3184062472MaRDI QIDQ832355FDOQ832355
Authors: James H. Davenport, Benjamin Pring 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81652-0_14
Recommendations
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Optimized quantum implementation of AES
- Quantum attacks against iterated block ciphers
- Improved BV-based quantum attack on block ciphers
- Quantum attacks on some Feistel block ciphers
- An efficient quantum somewhat homomorphic symmetric searchable encryption
- Implementing Grover oracles for quantum key search on AES and LowMC
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Cryptanalysis and improvement of several quantum private comparison protocols
- Quantum circuit implementations of AES with fewer qubits
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum search of spatial regions
- Quantum computation and quantum information. 10th anniversary edition
- Title not available (Why is that?)
- Implementing Grover oracles for quantum key search on AES and LowMC
- Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE
- Quantum reversible circuit of AES-128
- Solving binary \(\mathcal {MQ}\) with Grover's algorithm
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Applying Grover's algorithm to AES: quantum resource estimates
- Oracles with costs
- What is the effective key length for a block cipher: an attack on every practical block cipher
Cited In (19)
- Quantum implementation and resource estimates for rectangle and knot
- Some efficient quantum circuit implementations of Camellia
- Quantum Demiric-Selcuk meet-in-the-middle attacks on reduced-round AES
- Quantum resource estimation for FSR based symmetric ciphers and related Grover's attacks
- Quantum search for scaled hash function preimages
- Quantum key search with side channel advice
- Low-communication parallel quantum multi-target preimage search
- Applying Grover's algorithm to AES: quantum resource estimates
- Implementing Grover oracles for quantum key search on AES and LowMC
- Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
- Quantum circuit implementations of SM4 block cipher based on different gate sets
- Improved BV-based quantum attack on block ciphers
- Evaluation of Grover's algorithm toward quantum cryptanalysis on ChaCha
- Quantum circuit implementations of AES with fewer qubits
- Quantum linear key-recovery attacks using the QFT
- Quantum lattice enumeration in limited depth
- Quantum resource estimates of Grover's key search on ARIA
- Quantum circuit implementations of SM4 block cipher optimizing the number of qubits
- Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers
This page was built for publication: Improvements to quantum search techniques for block-ciphers, with applications to AES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832355)
