How to Break MD5 and Other Hash Functions
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- A synthetic indifferentiability analysis of some block-cipher-based hash functions
- On the impossibility of highly-efficient blockcipher-based hash functions
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm
- Another step towards realizing random oracles: non-malleable point obfuscation
- sLiSCP: Simeck-based permutations for lightweight sponge cryptographic primitives
- Chosen-prefix collisions for MD5 and applications
- Security analysis of randomize-hash-then-sign digital signatures
- Simple hash function using discrete-time quantum walks
- Quantum algorithm to find invariant linear structure of MD hash functions
- Cryptanalysis of SHA-0 and reduced SHA-1
- Controlling and restoring the integrity of multi-dimensional data arrays through cryptocode constructs
- Automatic verification of differential characteristics: application to reduced Gimli
- A quantum hash function with grouped coarse-grained boson sampling
- Preimage attacks on 4-round Keccak by solving multivariate quadratic systems
- House of graphs 2.0: a database of interesting graphs and more
- Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
- Finding hash collisions with quantum computers by using differential trails with smaller probability than birthday bound
- The design of keyed hash function based on CNN-MD structure
- Improved (semi-free-start/near-) collision and distinguishing attacks on round-reduced RIPEMD-160
- Generic attacks on hash combiners
- The phantom of differential characteristics
- Upper-bound estimation of the average probabilities of integer-valued differentials in the composition of key adder, substitution block, and shift operator
- Fast correlation attack on stream cipher ABC v3
- Hash function based on quantum walks
- The rebound attack and subspace distinguishers: application to Whirlpool
- High order differential attacks on stream ciphers
- Practical key-recovery attack against APOP, an MD5-based challenge-response authentication
- Survey of information security
- MILP-aided cube-attack-like cryptanalysis on Keccak keyed modes
- A secure and efficient on-line/off-line group key distribution protocol
- Practical collisions for EnRUPT
- Internal differential collision attacks on the reduced-round Grøstl-0 hash function
- Integral distinguishers for reduced-round Stribog
- Upper-bound estimates for the average probabilities of integer differentials of round functions of certain block ciphers
- One-way hash function construction based on 2D coupled map lattices
- Novel strategies for searching RC4 key collisions
- Calculating the number of solutions of a difference equation
- Collision attack on the full extended MD4 and pseudo-preimage attack on RIPEMD
- Unbounded dynamic predicate compositions in ABE from standard assumptions
- Improved collision detection of MD5 with additional sufficient conditions
- Analysis of Boomerang Differential Trails via a SAT-Based Constraint Solver URSA
- Post-quantum cryptography: state of the art
- One-key compression function based MAC with security beyond birthday bound
- Boomerang distinguishers on MD4-family: first practical results on full 5-pass HAVAL
- Using random error correcting codes in near-collision attacks on generic hash-functions
- Partial-collision attack on the round-reduced compression function of Skein-256
- Linear analysis of reduced-round CubeHash
- Analysis of message injection in stream cipher-based hash functions
- Collisions of MMO-MD5 and their impact on original MD5
- The NIST SHA-3 Competition: A Perspective on the Final Year
- Analysis of Reduced-SHAvite-3-256 v2
- Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
- Practical near-collisions on the compression function of BMW
- A fast pseudorandom number generator with BLAKE hash function
- Multicollision attacks and generalized iterated hash functions
- MJH: a faster alternative to MDC-2
- Optimal covering codes for finding near-collisions
- How to find short RC4 colliding key pairs
- Experimental verification of super-Sbox analysis -- confirmation of detailed attack complexity
- Practical Analysis of Reduced-Round Keccak
- Boomerang Distinguisher for the SIMD-512 Compression Function
- New second-preimage attacks on hash functions
- Cryptanalysis of full \texttt{RIPEMD-128}
- A structure-based chaotic hashing scheme
- Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
- Meet-in-the-Middle Attacks Using Output Truncation in 3-Pass HAVAL
- On Free-Start Collisions and Collisions for TIB3
- Exploration of key points for attack of the MD5 algorithm
- Cryptanalysis of the Round-Reduced GOST Hash Function
- Boomerang attack on step-reduced SHA-512
- The boomerang attacks on the round-reduced Skein-512
- Boomerang and slide-rotational analysis of the SM3 hash function
- Parallel Hashing via List Recoverability
- Cryptanalysis of Grindahl
- Does Secure Time-Stamping Imply Collision-Free Hash Functions?
- Password Recovery on Challenge and Response: Impossible Differential Attack on Hash Function
- Attacking Reduced Round SHA-256
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
- Non-linear Reduced Round Attacks against SHA-2 Hash Family
- Collisions for Round-Reduced LAKE
- Preimage Attacks on Step-Reduced MD5
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
- Second Preimage Attack on 3-Pass HAVAL and Partial Key-Recovery Attacks on HMAC/NMAC-3-Pass HAVAL
- A (Second) Preimage Attack on the GOST Hash Function
- MD4 is Not One-Way
- New Techniques for Cryptanalysis of Hash Functions and Improved Attacks on Snefru
- Digital Signatures Out of Second-Preimage Resistant Hash Functions
- Collisions for RC4-Hash
- Cryptanalysis of hash functions on the MD4-family.
- Herding Hash Functions and the Nostradamus Attack
- Cryptanalysis of the GOST Hash Function
- Compression from Collisions, or Why CRHF Combiners Have a Long Output
- Verifiable Multi-secret Sharing Schemes for Multiple Threshold Access Structures
- An Improved Collision Attack on MD5 Algorithm
- Hash Functions from Sigma Protocols and Improvements to VSH
- Preimage Attacks on 3, 4, and 5-Pass HAVAL
- How to Fill Up Merkle-Damgård Hash Functions
- A new one-bit difference collision attack on HAVAL-128
- Speeding up Collision Search for Byte-Oriented Hash Functions
- On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
This page was built for publication: How to Break MD5 and Other Hash Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385718)