Sciweavers

4 search results - page 1 / 1
» Collisions on SHA-0 in One Hour
Sort
View
FSE
2008
Springer
162views Cryptology» more  FSE 2008»
13 years 6 months ago
Collisions on SHA-0 in One Hour
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
Stéphane Manuel, Thomas Peyrin
ACNS
2006
Springer
117views Cryptology» more  ACNS 2006»
13 years 11 months ago
Do Broken Hash Functions Affect the Security of Time-Stamping Schemes?
We study the influence of collision-finding attacks on the security of time-stamping schemes. We distinguish between client-side hash functions used to shorten the documents befo...
Ahto Buldas, Sven Laur
EUROCRYPT
2005
Springer
13 years 10 months ago
How to Break MD5 and Other Hash Functions
Abstract. MD5 is one of the most widely used cryptographic hash functions nowadays. It was designed in 1992 as an improvement of MD4, and its security was widely studied since then...
Xiaoyun Wang, Hongbo Yu
ICMCS
2010
IEEE
165views Multimedia» more  ICMCS 2010»
13 years 6 months ago
On deriving longer fingerprints from features based on projections
We propose three methods to derive longer fingerprints from features using projection based hashing methods. For this class of hashing methods, a feature matrix is projected onto ...
Regunathan Radhakrishnan, Claus Bauer, Wenyu Jiang