Efficient Collision Search Attacks on SHA-0
From MaRDI portal
Publication:5451015
DOI10.1007/11535218_1zbMATH Open1145.94455OpenAlexW2131212920MaRDI QIDQ5451015FDOQ5451015
Recommendations
Cited In (56)
- Analysis of RIPEMD-160: new collision attacks and finding characteristics with MILP
- New records in collision attacks on SHA-2
- Allocating rotational cryptanalysis-based preimage attack on 4-round \textsc{Keccak}-224 for quantum setting
- Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
- Preimage attacks on 4-round Keccak by solving multivariate quadratic systems
- Cryptography and Coding
- A Three-Property-Secure Hash Function
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
- The Delicate Issues of Addition with Respect to XOR Differences
- Title not available (Why is no real title available?)
- Non-linear Reduced Round Attacks against SHA-2 Hash Family
- Second Preimage Attack on 5-Pass HAVAL and Partial Key-Recovery Attack on HMAC/NMAC-5-Pass HAVAL
- Bit-Free Collision: Application to APOP Attack
- Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques
- The NIST SHA-3 Competition: A Perspective on the Final Year
- Collisions on SHA-0 in One Hour
- Improved Collision Attack on the Hash Function Proposed at PKC’98
- Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- Second Preimage Attack on 3-Pass HAVAL and Partial Key-Recovery Attacks on HMAC/NMAC-3-Pass HAVAL
- Survey of information security
- Cryptanalysis of SHA-0 and reduced SHA-1
- Differential entropy analysis of the IDEA block cipher
- Cryptanalysis of Grindahl
- How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
- Advances in Cryptology – CRYPTO 2004
- Finding Collisions in the Full SHA-1
- Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
- Password Recovery on Challenge and Response: Impossible Differential Attack on Hash Function
- Improved Collision Search for SHA-0
- Collisions for RC4-Hash
- Does Secure Time-Stamping Imply Collision-Free Hash Functions?
- Cryptanalysis of the Round-Reduced GOST Hash Function
- Cryptanalysis of full \texttt{RIPEMD-128}
- New second-preimage attacks on hash functions
- Multi-collision Attack on the Compression Functions of MD4 and 3-Pass HAVAL
- Collisions of SHA-0 and Reduced SHA-1
- On the impossibility of highly-efficient blockcipher-based hash functions
- Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
- Finding SHA-1 Characteristics: General Results and Applications
- Security analysis of randomize-hash-then-sign digital signatures
- Coding and Cryptography
- Collision attack on \({\mathtt Grindahl}\)
- Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC
- Distinguishing Attack on the Secret-Prefix MAC Based on the 39-Step SHA-256
- Efficient Hash Collision Search Strategies on Special-Purpose Hardware
- Quantum algorithm to find invariant linear structure of \(MD\) hash functions
- Improved (semi-free-start/near-) collision and distinguishing attacks on round-reduced RIPEMD-160
- Collision attack on the full extended MD4 and pseudo-preimage attack on RIPEMD
- Revisiting RC4 key collision: faster search algorithm and new 22-byte colliding key pairs
- New collision attacks on SHA-1 based on optimal joint local-collision analysis
- Herding Hash Functions and the Nostradamus Attack
- An Improved Collision Attack on MD5 Algorithm
- New Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
- Classification and generation of disturbance vectors for collision attacks against SHA-1
- New Collision Attacks against Up to 24-Step SHA-2
This page was built for publication: Efficient Collision Search Attacks on SHA-0
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451015)
