Quantum collision attacks on AES-like hashing with low quantum random access memories
From MaRDI portal
Publication:2692403
DOI10.1007/978-3-030-64834-3_25OpenAlexW3091366409MaRDI QIDQ2692403
Publication date: 21 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64834-3_25
Cryptography (94A60) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)
Related Items (17)
Quantum collision attacks on reduced SHA-256 and SHA-512 ⋮ Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks ⋮ A note on quantum collision resistance of double-block-length compression functions ⋮ Quantum key recovery attacks on tweakable Even-Mansour ciphers ⋮ Improved attacks against reduced-round Whirlwind ⋮ Triangulating rebound attack on AES-like hashing ⋮ Allocating rotational cryptanalysis-based preimage attack on 4-round \textsc{Keccak}-224 for quantum setting ⋮ Nostradamus goes quantum ⋮ Exploring SAT for cryptanalysis: (quantum) collision attacks against 6-round SHA-3 ⋮ Quantum attacks against BBB secure PRFs or MACs built from public random permutations ⋮ Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials ⋮ Quantum circuit implementations of AES with fewer qubits ⋮ Automatic search of meet-in-the-middle preimage attacks on AES-like hashing ⋮ Quantum zero correlation linear cryptanalysis ⋮ A quantum hash function with grouped coarse-grained boson sampling ⋮ Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions ⋮ Attacks on beyond-birthday-bound MACs in the quantum setting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On quantum slide attacks
- Quantum algorithms for the \(k\)-XOR problem
- Grover meets Simon -- quantumly attacking the FX-construction
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Quantum Demiric-Selçuk meet-in-the-middle attacks: applications to 6-round generic Feistel constructions
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Implementing Grover oracles for quantum key search on AES and LowMC
- Quantum attacks without superposition queries: the offline Simon's algorithm
- Quantum attacks on some Feistel block ciphers
- Cryptanalysis against symmetric-key schemes with online classical queries and offline quantum computations
- The rebound attack and subspace distinguishers: application to Whirlpool
- Breaking Symmetric Cryptosystems Using Quantum Period Finding
- Improved Analysis of ECHO-256
- Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-Oriented Block Ciphers
- Collision Attack on 5 Rounds of Grøstl
- Multiple Limited-Birthday Distinguishers and Applications
- Non-full-active Super-Sbox Analysis: Applications to ECHO and Grøstl
- Quantum Random Access Memory
- The Rebound Attack: Cryptanalysis of Reduced Whirlpool and Grøstl
- Super-Sbox Cryptanalysis: Improved Attacks for AES-Like Permutations
- Rebound Distinguishers: Results on the Full Whirlpool Compression Function
- On the Power of Quantum Computation
- Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
- Improved Rebound Attack on the Finalist Grøstl
- How to Improve Rebound Attacks
- On the Robustness of Bucket Brigade Quantum RAM
- Quantum cryptanalysis of hash and claw-free functions
This page was built for publication: Quantum collision attacks on AES-like hashing with low quantum random access memories
