23 search results - page 4 / 5 » Preimage and Collision Attacks on MD2 |
FSE
2008
Springer
13 years 9 months ago
2008
Springer
In this paper, we point out some weaknesses in the Salsa20 core function that could be exploited to obtain up to 231 collisions for its full (20 rounds) version. We first find an i...
EUROCRYPT
2004
Springer
14 years 26 days 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...
CRYPTO
2008
Springer
13 years 9 months ago
2008
Springer
In this article, we analyze the security of the GOST hash function. The GOST hash function, defined in the Russian standard GOST 34.11-94, is an iterated hash function producing a ...
CRYPTO
2009
Springer
14 years 2 months ago
2009
Springer
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...
SACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we analyze the hash functions Dynamic SHA and Dynamic SHA2, which have been selected as first round candidates in the NIST hash function competition. These hash fun...