Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
From MaRDI portal
Publication:2107924
Recommendations
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Quantum collision attacks on reduced SHA-256 and SHA-512
- Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials
- An efficient quantum collision search algorithm and implications on symmetric cryptography
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 503327 (Why is no real title available?)
- scientific article; zbMATH DE number 1024070 (Why is no real title available?)
- scientific article; zbMATH DE number 1942429 (Why is no real title available?)
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Classical vs quantum random oracles
- Distinguisher and Related-Key Attack on the Full AES-256
- Finding Collisions in the Full SHA-1
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- How to Break MD5 and Other Hash Functions
- Low-communication parallel quantum multi-target preimage search
- MJH: a faster alternative to MDC-2
- MJH: a faster alternative to MDC-2
- Meet-in-the-middle preimage attacks on AES hashing modes and an application to Whirlpool
- On quantum related-key attacks on iterated Even-Mansour ciphers
- On the (in)security of IDEA in various hashing modes
- Parallel collision search with cryptanalytic applications
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- Quantum collision attacks on reduced SHA-256 and SHA-512
- Quantum cryptanalysis of hash and claw-free functions
- Random oracles in a quantum world
- Security of cyclic double block length hash functions
- Some Plausible Constructions of Double-Block-Length Hash Functions
- Speeding up Collision Search for Byte-Oriented Hash Functions
- The Collision Intractability of MDC-2 in the Ideal-Cipher Model
- The collision security of MDC-4
- The collision security of Tandem-DM in the ideal cipher model
Cited in
(5)- Quantum collision attacks on reduced SHA-256 and SHA-512
- Automatic classical and quantum rebound attacks on AES-like hashing by exploiting related-key differentials
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Exploring SAT for cryptanalysis: (quantum) collision attacks against 6-round SHA-3
- Quantum collision attacks on AES-like hashing with low quantum random access memories
This page was built for publication: Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107924)
