Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
From MaRDI portal
Publication:5385746
DOI10.1007/11426639_28zbMath1137.94350OpenAlexW1533007301WikidataQ27980393 ScholiaQ27980393MaRDI QIDQ5385746
Publication date: 6 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11426639_28
Related Items (46)
Improved indifferentiability security bound for the JH mode ⋮ Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier ⋮ Provable Security of BLAKE with Non-ideal Compression Function ⋮ New second-preimage attacks on hash functions ⋮ Differential property of \textsc{Present}-like structure ⋮ Security analysis of randomize-hash-then-sign digital signatures ⋮ Open problems in hash function security ⋮ Cryptanalysis of Grindahl ⋮ Generic attacks on hash combiners ⋮ Improved generic attacks against hash-based MACs and HAIFA ⋮ How (Not) to Efficiently Dither Blockcipher-Based Hash Functions? ⋮ Nostradamus goes quantum ⋮ Collision attack on \({\mathtt Grindahl}\) ⋮ 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 ⋮ MD4 is Not One-Way ⋮ A new black box analysis of hash functions based on block ciphers ⋮ Collisions for RC4-Hash ⋮ Linear Analysis of Reduced-Round CubeHash ⋮ An Improved Algebraic Attack on Hamsi-256 ⋮ Meet-in-the-Middle Preimage Attacks on AES Hashing Modes and an Application to Whirlpool ⋮ Fast correlation attack on stream cipher ABC v3 ⋮ Herding Hash Functions and the Nostradamus Attack ⋮ 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 ⋮ (Second) Preimage Attacks on Step-Reduced RIPEMD/RIPEMD-128 with a New Local-Collision Approach ⋮ Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks ⋮ On Randomizing Hash Functions to Strengthen the Security of Digital Signatures ⋮ Cryptanalysis of MDC-2 ⋮ Finding Preimages in Full MD5 Faster Than Exhaustive Search ⋮ A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier ⋮ The Latin squares and the secret sharing schemes ⋮ Characterizing Padding Rules of MD Hash Functions Preserving Collision Security ⋮ On the Weak Ideal Compression Functions ⋮ Preimage Attacks on One-Block MD4, 63-Step MD5 and More ⋮ A Three-Property-Secure Hash Function ⋮ Memory-Efficient Algorithms for Finding Needles in Haystacks ⋮ Increasing the flexibility of the herding attack ⋮ New records of pre-image search of reduced SHA-1 using SAT solvers ⋮ Hash Functions and RFID Tags: Mind the Gap ⋮ Faster Multicollisions ⋮ How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
This page was built for publication: Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
