114 search results - page 21 / 23 » Improved Collision Attack on Hash Function MD5 |
FSE
2010
Springer
15 years 2 months ago
2010
Springer
In this paper, we improve the recent rebound and start-from-the-middle attacks on AES-like permutations. Our new cryptanalysis technique uses the fact that one can view two rounds ...
89
Voted
ACISP
2010
Springer
14 years 7 months ago
2010
Springer
Many applications using cryptographic hash functions do not require collision resistance, but some kind of preimage resistance. That's also the reason why the widely used SHA-...
IACR
2011
13 years 9 months ago
2011
We revisit meet-in-the-middle attacks on block ciphers and recent developments in meet-in-the-middle preimage attacks on hash functions. Despite the presence of a secret key in the...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
IACR
2011
13 years 9 months ago
2011
Abstract. We show that the Winternitz one-time signature scheme is existentially unforgeable under adaptive chosen message attacks when instantiated with a family of pseudo random ...