Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
From MaRDI portal
Publication:2107924
DOI10.1007/S11128-022-03499-5OpenAlexW4224942278MaRDI QIDQ2107924FDOQ2107924
Seung Jun Baek, Jongsung Kim, Sehee Cho
Publication date: 5 December 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-022-03499-5
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Parallel collision search with cryptanalytic applications
- Distinguisher and Related-Key Attack on the Full AES-256
- Finding Collisions in the Full SHA-1
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the (In)Security of IDEA in Various Hashing Modes
- How to Break MD5 and Other Hash Functions
- Quantum cryptanalysis of hash and claw-free functions
- Analysis of the single-permutation encrypted Davies-Meyer construction
- On quantum related-key attacks on iterated Even-Mansour ciphers
- Random Oracles in a Quantum World
- Meet-in-the-Middle Preimage Attacks on AES Hashing Modes and an Application to Whirlpool
- MJH: A Faster Alternative to MDC-2
- Some Plausible Constructions of Double-Block-Length Hash Functions
- Security of cyclic double block length hash functions
- MJH: a faster alternative to MDC-2
- The Collision Security of Tandem-DM in the Ideal Cipher Model
- The Collision Intractability of MDC-2 in the Ideal-Cipher Model
- Speeding up Collision Search for Byte-Oriented Hash Functions
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Low-communication parallel quantum multi-target preimage search
- Classical vs quantum random oracles
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- Quantum collision attacks on AES-like hashing with low quantum random access memories
- Quantum collision attacks on reduced SHA-256 and SHA-512
- The Collision Security of MDC-4
Cited In (3)
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)