Speeding up Collision Search for Byte-Oriented Hash Functions
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1024070 (Why is no real title available?)
- Collisions on SHA-0 in One Hour
- Cryptanalysis of FORK-256
- Cryptanalysis of Grindahl
- Cryptanalysis of LASH
- Finding Collisions in the Full SHA-1
- Finding SHA-1 Characteristics: General Results and Applications
- How to Break MD5 and Other Hash Functions
- The Grindahl Hash Functions
- The Hash Function Family LAKE
- The Wide Trail Design Strategy
Cited in
(13)- Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
- A collision attack on a double-block-length compression function instantiated with round-reduced AES-256
- Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques
- Practical cryptanalysis of ARMADILLO2
- scientific article; zbMATH DE number 4132087 (Why is no real title available?)
- Automatic Search for Key-Bridging Technique: Applications to LBlock and TWINE
- Improved practical attacks on round-reduced Keccak
- Linearization framework for collision attacks: application to CubeHash and MD6
- Automatic search of meet-in-the-middle and impossible differential attacks
- Triangulating meet-in-the-middle attack
- Guess-and-determine rebound: applications to key collisions on \textsf{AES}
- Triangulating rebound attack on AES-like hashing
- Attacks on hash functions based on Generalized Feistel: application to reduced-round \textit{Lesamnta} and \textit{SHAvite-3}\(_{512}\)
This page was built for publication: Speeding up Collision Search for Byte-Oriented Hash Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3623043)
