Improvements to quantum search techniques for block-ciphers, with applications to AES
From MaRDI portal
Publication:832355
DOI10.1007/978-3-030-81652-0_14zbMath1485.94078OpenAlexW3184062472MaRDI QIDQ832355
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
Related Items (4)
Quantum resource estimation for FSR based symmetric ciphers and related Grover's attacks ⋮ Quantum linear key-recovery attacks using the QFT ⋮ Quantum search for scaled hash function preimages ⋮ Evaluation of Grover's algorithm toward quantum cryptanalysis on ChaCha
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- What is the effective key length for a block cipher: an attack on every practical block cipher
- 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
- Implementing Grover oracles for quantum key search on AES and LowMC
- Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates
- Quantum Computation and Quantum Information
- Oracles with Costs
This page was built for publication: Improvements to quantum search techniques for block-ciphers, with applications to AES