Herding Hash Functions and the Nostradamus Attack
From MaRDI portal
(Redirected from Publication:3593096)
Recommendations
Cites work
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Collisions of SHA-0 and Reduced SHA-1
- Cryptanalysis of the Hash Functions MD4 and RIPEMD
- Efficient Collision Search Attacks on SHA-0
- Finding Collisions in the Full SHA-1
- How to Break MD5 and Other Hash Functions
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 177045 (Why is no real title available?)
- scientific article; zbMATH DE number 503327 (Why is no real title available?)
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Parallel collision search with cryptanalytic applications
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Topics in Cryptology – CT-RSA 2005
Cited in
(43)- Improved generic attacks against hash-based MACs and HAIFA
- New second preimage attacks on dithered hash functions with low memory complexity
- Generic attacks on hash combiners
- Fast correlation attack on stream cipher ABC v3
- Secure hash algorithm-2 formed on DNA
- Quark: a lightweight hash
- Memory-Efficient Algorithms for Finding Needles in Haystacks
- Improved indifferentiability security bound for the JH mode
- On diamond structures and Trojan message attacks
- Provable chosen-target-forced-midfix preimage resistance
- Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
- Linear analysis of reduced-round CubeHash
- Multicollision attacks and generalized iterated hash functions
- On chosen target forced prefix preimage resistance
- New second-preimage attacks on hash functions
- Cryptanalysis of Grindahl
- Does Secure Time-Stamping Imply Collision-Free Hash Functions?
- How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
- Slide Attacks on a Class of Hash Functions
- How to Fill Up Merkle-Damgård Hash Functions
- Salvaging Merkle-Damgård for Practical Applications
- Hash function requirements for Schnorr signatures
- On the Weak Ideal Compression Functions
- Herding, second preimage and Trojan message attacks beyond Merkle-Damgård
- On the complexity of the herding attack and some related attacks on hash functions
- Some methods of hash functions analysis with application to the GOST P 34.11-94 algorithm
- Brute force attacks on hash functions
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- Faster Multicollisions
- Applied Cryptography and Network Security
- Identification protocols and signature schemes based on supersingular isogeny problems
- Nostradamus goes quantum
- Breaking category five \(\mathrm{SPHINCS}^+\) with SHA-256
- A new black box analysis of hash functions based on block ciphers
- Quantum attacks on hash constructions with low quantum random access memory
- Improving generic attacks using exceptional functions
- Generalized indifferentiable sponge and its application to Polygon Miden VM
- Quantum security of Trojan message attacks on Merkle-Damgård hash construction
- The order of hashing in Fiat-Shamir schemes
- Increasing the flexibility of the herding attack
- Open problems in hash function security
- Collision attack on \({\mathtt Grindahl}\)
This page was built for publication: Herding Hash Functions and the Nostradamus Attack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3593096)
