Pages that link to "Item:Q5385718"
From MaRDI portal
The following pages link to How to Break MD5 and Other Hash Functions (Q5385718):
Displayed 50 items.
- Linear Analysis of Reduced-Round CubeHash (Q3011313) (← links)
- Analysis of Message Injection in Stream Cipher-Based Hash Functions (Q3011315) (← links)
- Collisions of MMO-MD5 and Their Impact on Original MD5 (Q3011908) (← links)
- The NIST SHA-3 Competition: A Perspective on the Final Year (Q3011930) (← links)
- Analysis of Reduced-SHAvite-3-256 v2 (Q3013078) (← links)
- Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function (Q3013080) (← links)
- Practical Near-Collisions on the Compression Function of BMW (Q3013087) (← links)
- A fast pseudorandom number generator with BLAKE hash function (Q3017399) (← links)
- Multicollision attacks and generalized iterated hash functions (Q3068175) (← links)
- MJH: A Faster Alternative to MDC-2 (Q3073709) (← links)
- Optimal Covering Codes for Finding Near-Collisions (Q3084254) (← links)
- How to Find Short RC4 Colliding Key Pairs (Q3095096) (← links)
- Experimental Verification of Super-Sbox Analysis — Confirmation of Detailed Attack Complexity (Q3098004) (← links)
- Practical Analysis of Reduced-Round Keccak (Q3104737) (← links)
- Boomerang Distinguisher for the SIMD-512 Compression Function (Q3104738) (← links)
- Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n (Q3399201) (← links)
- Meet-in-the-Middle Attacks Using Output Truncation in 3-Pass HAVAL (Q3399202) (← links)
- On Free-Start Collisions and Collisions for TIB3 (Q3399203) (← links)
- Cryptanalysis of the Round-Reduced GOST Hash Function (Q3454162) (← links)
- Boomerang Attack on Step-Reduced SHA-512 (Q3454592) (← links)
- The Boomerang Attacks on the Round-Reduced Skein-512 (Q3455506) (← links)
- Boomerang and Slide-Rotational Analysis of the SM3 Hash Function (Q3455507) (← links)
- Parallel Hashing via List Recoverability (Q3457065) (← links)
- Cryptanalysis of Grindahl (Q3498399) (← links)
- Does Secure Time-Stamping Imply Collision-Free Hash Functions? (Q3503876) (← links)
- Password Recovery on Challenge and Response: Impossible Differential Attack on Hash Function (Q3506389) (← links)
- Attacking Reduced Round SHA-256 (Q3506406) (← links)
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography (Q3506407) (← links)
- Non-linear Reduced Round Attacks against SHA-2 Hash Family (Q3511168) (← links)
- Collisions for Round-Reduced LAKE (Q3511169) (← links)
- Preimage Attacks on Step-Reduced MD5 (Q3511170) (← links)
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak (Q3519537) (← links)
- Second Preimage Attack on 3-Pass HAVAL and Partial Key-Recovery Attacks on HMAC/NMAC-3-Pass HAVAL (Q3525673) (← links)
- A (Second) Preimage Attack on the GOST Hash Function (Q3525675) (← links)
- MD4 is Not One-Way (Q3525692) (← links)
- Digital Signatures Out of Second-Preimage Resistant Hash Functions (Q3535355) (← links)
- Collisions for RC4-Hash (Q3540156) (← links)
- Herding Hash Functions and the Nostradamus Attack (Q3593096) (← links)
- Cryptanalysis of the GOST Hash Function (Q3600219) (← links)
- Compression from Collisions, or Why CRHF Combiners Have a Long Output (Q3600232) (← links)
- Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures (Q3600329) (← links)
- An Improved Collision Attack on MD5 Algorithm (Q3600345) (← links)
- Hash Functions from Sigma Protocols and Improvements to VSH (Q3600369) (← links)
- Preimage Attacks on 3, 4, and 5-Pass HAVAL (Q3600379) (← links)
- How to Fill Up Merkle-Damgård Hash Functions (Q3600380) (← links)
- Speeding up Collision Search for Byte-Oriented Hash Functions (Q3623043) (← links)
- On Randomizing Hash Functions to Strengthen the Security of Digital Signatures (Q3627429) (← links)
- Cryptanalysis on HMAC/NMAC-MD5 and MD5-MAC (Q3627431) (← links)
- Finding Preimages in Full MD5 Faster Than Exhaustive Search (Q3627432) (← links)
- Hash function requirements for Schnorr signatures (Q3632752) (← links)