114 search results - page 18 / 23 » Improved Collision Attack on Hash Function MD5 |
FSE
2008
Springer
15 years 1 months ago
2008
Springer
We show that the LASH-x hash function is vulnerable to attacks that trade time for memory, including collision attacks as fast as 2(4x/11) and preimage attacks as fast as 2(4x/7) ....
120
click to vote
GLOBECOM
2008
IEEE
14 years 12 months ago
2008
IEEE
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
116
click to vote
CRYPTO
1997
Springer
15 years 3 months ago
1997
Springer
This paper considers hash functions based on block ciphers. It presents a new attack on the compression function of the 128-bit hash function MDC-4 using DES with a complexity far ...
ASIACRYPT
2009
Springer
15 years 6 months ago
2009
Springer
In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear messag...
112
click to vote
FSE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...