Advances in Cryptology – CRYPTO 2004
From MaRDI portal
Publication:5311540
DOI10.1007/b99099zbMath1104.68043OpenAlexW2477011922WikidataQ27980744 ScholiaQ27980744MaRDI QIDQ5311540
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
Related Items (51)
Provable Chosen-Target-Forced-Midfix Preimage Resistance ⋮ Improved indifferentiability security bound for the JH mode ⋮ Unintended features of APIs: cryptanalysis of incremental HMAC ⋮ Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier ⋮ Cryptanalysis of the Round-Reduced GOST Hash Function ⋮ Secure data storage in cloud: an e-stream cipher-based secure and dynamic updation policy ⋮ New second-preimage attacks on hash functions ⋮ ERINDALE: A Polynomial Based Hashing Algorithm ⋮ The design of keyed hash function based on CNN-MD structure ⋮ Unavoidable regularities in long words with bounded number of symbol occurrences ⋮ Cryptanalysis of Grindahl ⋮ Keyed Streebog is a secure PRF and MAC ⋮ Cryptanalysis of GOST R hash function ⋮ Generic attacks on hash combiners ⋮ Improved generic attacks against hash-based MACs and HAIFA ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ Collision-resistance from multi-collision-resistance ⋮ How (Not) to Efficiently Dither Blockcipher-Based Hash Functions? ⋮ On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing ⋮ Collision attack on \({\mathtt Grindahl}\) ⋮ Preimage Attacks on Step-Reduced MD5 ⋮ On the complexity of the herding attack and some related attacks on hash functions ⋮ Breaking category five \(\mathrm{SPHINCS}^+\) with SHA-256 ⋮ New second preimage attacks on dithered hash functions with low memory complexity ⋮ On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak ⋮ A (Second) Preimage Attack on the GOST Hash Function ⋮ A new black box analysis of hash functions based on block ciphers ⋮ Collisions for RC4-Hash ⋮ Multi-collision Attack on the Compression Functions of MD4 and 3-Pass HAVAL ⋮ Linear Analysis of Reduced-Round CubeHash ⋮ Fast correlation attack on stream cipher ABC v3 ⋮ Efficient dissection of bicomposite problems with cryptanalytic applications ⋮ Cryptanalysis of MD2 ⋮ Herding Hash Functions and the Nostradamus Attack ⋮ Cryptanalysis of the GOST Hash Function ⋮ Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers ⋮ Slide Attacks on a Class of Hash Functions ⋮ How to Fill Up Merkle-Damgård Hash Functions ⋮ Building indifferentiable compression functions from the PGV compression functions ⋮ Некоторые методы анализа функций хэширования и их применение к алгоритму ГОСТ Р 34.11-94 ⋮ Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks ⋮ Cryptanalysis of MDC-2 ⋮ A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier ⋮ The Latin squares and the secret sharing schemes ⋮ Inside the Hypercube ⋮ Meet-in-the-Middle Preimage Attacks on Double-Branch Hash Functions: Application to RIPEMD and Others ⋮ On the Weak Ideal Compression Functions ⋮ Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n ⋮ Increasing the flexibility of the herding attack ⋮ Hash Functions and RFID Tags: Mind the Gap ⋮ Faster Multicollisions
This page was built for publication: Advances in Cryptology – CRYPTO 2004
