Sciweavers

4 search results - page 1 / 1
» Characterizing Padding Rules of MD Hash Functions Preserving...
Sort
View
CTRSA
2006
Springer
146views Cryptology» more  CTRSA 2006»
13 years 9 months ago
Collision-Resistant Usage of MD5 and SHA-1 Via Message Preprocessing
A series of recent papers have demonstrated collision attacks on popularly used hash functions, including the widely deployed MD5 and SHA-1 algorithm. To assess this threat, the na...
Michael Szydlo, Yiqun Lisa Yin
FSE
2007
Springer
107views Cryptology» more  FSE 2007»
13 years 11 months ago
Message Freedom in MD4 and MD5 Collisions: Application to APOP
Abstract. In Wang’s attack, message modifications allow to deterministically satisfy certain sufficient conditions to find collisions efficiently. Unfortunately, message modi...
Gaëtan Leurent
CRYPTO
2009
Springer
119views Cryptology» more  CRYPTO 2009»
14 years 13 hour ago
How Risky Is the Random-Oracle Model?
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes. We show that the random-oracle instanti...
Gaëtan Leurent, Phong Q. Nguyen