Generic Collision Attacks on Narrow-pipe Hash Functions Faster than Birthday Paradox, Applicable to MDx, SHA-1, SHA-2, and SHA-3 Narrow-pipe Candidates

Vlastimil KlĂ­ma, Danilo Gligoroski. Generic Collision Attacks on Narrow-pipe Hash Functions Faster than Birthday Paradox, Applicable to MDx, SHA-1, SHA-2, and SHA-3 Narrow-pipe Candidates. IACR Cryptology ePrint Archive, 2010:430, 2010. [doi]

Abstract

Abstract is missing.