713 search results - page 18 / 143 » Dispersing Hash Functions |
AFRICACRYPT
2008
Springer
14 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...
EUROCRYPT
2004
Springer
15 years 3 months ago
2004
Springer
Textbooks tell us that a birthday attack on a hash function h with range size r requires r1/2 trials (hash computations) to find a collision. But this is quite misleading, being t...
ASIACRYPT
2006
Springer
15 years 1 months ago
2006
Springer
Understanding what construction strategy has a chance to be a good hash function is extremely important nowadays. In TCC'04, Maurer et al. [13] introduced the notion of indiff...
ICCD
2007
IEEE
15 years 1 months ago
2007
IEEE
Transaction-level modeling (TLM) allows a designer to save functional verification effort during the modular refinement of an SoC by reusing the prior implementation of a module a...
ASIACRYPT
2007
Springer
15 years 3 months ago
2007
Springer
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...