19 search results - page 3 / 4 » On the Impossibility of Efficiently Combining Collision Resi... |
AFRICACRYPT
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. In the context of iterated hash functions, "dithering" designates the technique of adding an iteration-dependent input to the compression function in order to d...
ACNS
2006
Springer
14 years 3 months ago
2006
Springer
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...
CCS
2009
ACM
14 years 10 months ago
2009
ACM
In this work, we study several properties of the SHA-2 design which have been utilized in recent collision attacks against reduced round SHA-2. Small modifications to the SHA-2 des...
EUROCRYPT
2008
Springer
13 years 11 months ago
2008
Springer
We provide attacks and analysis that capture a tradeoff, in the ideal-permutation model, between the speed of a permutation-based hash function and its potential security. For coll...
IACR
2011
12 years 9 months ago
2011
The Keccak hash function is one of the five finalists in NIST’s SHA-3 competition, and so far it showed remarkable resistance against practical collision finding attacks: Afte...