4 search results - page 1 / 1 » Multicollisions in Iterated Hash Functions. Application to C... |
CRYPTO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. In this paper, we study the existence of multicollisions in iterated hash functions. We show that finding multicollisions, i.e. r-tuples of messages that all hash to the...
CHES
2010
Springer
13 years 6 months ago
2010
Springer
The need for lightweight (that is, compact, low-power, low-energy) cryptographic hash functions has been repeatedly expressed by application designers, notably for implementing RFI...
CRYPTO
2007
Springer
13 years 11 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...
AFRICACRYPT
2008
Springer
13 years 7 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...