Advances in Cryptology – CRYPTO 2004
From MaRDI portal
Publication:5311540
DOI10.1007/B99099zbMATH Open1104.68043DBLPconf/crypto/2004OpenAlexW2477011922MaRDI QIDQ5311540FDOQ5311540
Authors: Antoine Joux 
Publication date: 23 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99099
Recommendations
- Generalized iterated hash fuctions revisited: new complexity bounds for multicollision attacks
- Multicollision attacks and generalized iterated hash functions
- Variants of multicollision attacks on iterated hash functions
- Multicollision Attacks on Some Generalized Sequential Hash Functions
- Multi-collision resistance: a paradigm for keyless hash functions
- New constructions of collapsing hashes
- Multi-collision resistant hash functions and their applications
- Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
- On Quantifying the Resistance of Concrete Hash Functions to Generic Multicollision Attacks
Cited In (65)
- Cryptanalysis of GOST R hash function
- A (Second) Preimage Attack on the GOST Hash Function
- How to Fill Up Merkle-Damgård Hash Functions
- Unintended features of APIs: cryptanalysis of incremental HMAC
- Cryptanalysis of the GOST Hash Function
- Cryptanalysis of MD2
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
- On the Weak Ideal Compression Functions
- The universality of iterated hashing over variable-length strings
- Title not available (Why is that?)
- Some methods of hash functions analysis with application to the GOST P 34.11-94 algorithm
- Slide Attacks on a Class of Hash Functions
- Improved indifferentiability security bound for the JH mode
- Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others
- Efficient dissection of bicomposite problems with cryptanalytic applications
- The Latin squares and the secret sharing schemes
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- Cryptanalysis of Grindahl
- Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier
- Building indifferentiable compression functions from the PGV compression functions
- On the complexity of the herding attack and some related attacks on hash functions
- Secure data storage in cloud: an e-stream cipher-based secure and dynamic updation policy
- Linear analysis of reduced-round CubeHash
- Practical Pseudo-collisions for Hash Functions ARIRANG-224/384
- How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
- Collisions for RC4-Hash
- Multi-block Collisions in Hash Functions Based on 3C and 3C+ Enhancements of the Merkle-Damgård Construction
- Cryptanalysis of MDC-2
- Cryptanalysis of the Round-Reduced GOST Hash Function
- New second-preimage attacks on hash functions
- Multi-collision Attack on the Compression Functions of MD4 and 3-Pass HAVAL
- Faster Multicollisions
- Fast correlation attack on stream cipher ABC v3
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
- On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
- Multicollision attacks and generalized iterated hash functions
- Variants of multicollision attacks on iterated hash functions
- ERINDALE: A Polynomial Based Hashing Algorithm
- The design of keyed hash function based on CNN-MD structure
- Increasing the flexibility of the herding attack
- Collision attack on \({\mathtt Grindahl}\)
- Collision-resistance from multi-collision-resistance
- Inside the Hypercube
- Collisions for the LPS Expander Graph Hash Function
- Generalized iterated hash fuctions revisited: new complexity bounds for multicollision attacks
- Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
- Improved generic attacks against hash-based MACs and HAIFA
- Hash Functions and RFID Tags: Mind the Gap
- A new black box analysis of hash functions based on block ciphers
- New second preimage attacks on dithered hash functions with low memory complexity
- Provable chosen-target-forced-midfix preimage resistance
- Generic attacks on hash combiners
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- Multicollision Attacks on Some Generalized Sequential Hash Functions
- Herding Hash Functions and the Nostradamus Attack
- Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
- Preimage Attacks on Step-Reduced MD5
- Unavoidable regularities in long words with bounded number of symbol occurrences
- A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier
- Breaking category five \(\mathrm{SPHINCS}^+\) with SHA-256
- Quantum attacks on hash constructions with low quantum random access memory
- Keyed Streebog is a secure PRF and MAC
- Collision Resistance from Multi-collision Resistance
- Improving generic attacks using exceptional functions
- Collision resistance from multi-collision resistance for all constant parameters
This page was built for publication: Advances in Cryptology – CRYPTO 2004
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311540)
