114 search results - page 11 / 23 » Improved Collision Attack on Hash Function MD5 |
ICMCS
2009
IEEE
14 years 9 months ago
2009
IEEE
In this paper, we study the collision property of one of the robust hash functions proposed in [1]. This method was originally proposed for robust hash generation from blocks of i...
ISW
2009
Springer
15 years 6 months ago
2009
Springer
The recently started SHA-3 competition in order to find a new secure hash standard and thus a replacement for SHA-1/SHA-2 has attracted a lot of interest in the academic world as ...
ICISC
2007
15 years 1 months ago
2007
A simple method for constructing collisions for Shpilrain’s polynomial-based hash function from ICISC 2006 is presented. The attack relies on elementary linear algebra and can be...
117
click to vote
DAGSTUHL
2007
15 years 1 months ago
2007
This paper proposes a construction for collision resistant 2n-bit hash functions, based on n-bit block ciphers with 2n-bit keys. The construction is analysed in the ideal cipher mo...
ISW
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we present free-start collisions for the TIB3 hash function with a complexity of about 232 compression function evaluations. By using message modification technique...