Over the last two or three years there has been a huge amount of interest in hash-function specific collision attacks. In this talk we will consider a slightly different problem, namely the difficulty of finding a collision for an arbitrary hash-function, i.e. using methods which work regardless of how the internals of the hash-function are designed. The results suggest that finding collisions for hash-functions may be slightly easier than was previously believed. The implications of this for applications of hash-functions including HMAC are explored
Title: Security and usability of standard hash functions, in particular MD-5, SHA-1 and SHA-2 Author...
. This paper presents an attack on Gong's proposed collisionful hash function. The weaknesses o...
Abstract. In this paper, we present new collision search attacks on the hash function SHA-1. We show...
We survey theory and applications of cryptographic hash functions, such as MD5 and SHA-1, especially...
Abstract. In this paper, we present new collision search attacks on the hash function SHA-1. We show...
Message Authentication Code (MAC) algorithms can provide cryptographically secure authentication ser...
Abstract. The design principle of Merkle-Damg˚ard construction is collision resistance of the compre...
In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions f...
Cryptographic hash functions compute a small fixed-size hash value for any given message. A main app...
Recent attacks on hash functions start by constructing a differential characteristic. By finding mes...
In this work we consider generic algorithms to find near-collisions for a hash function. If we consi...
The Zémor-Tillich hash function has remained unbroken since its introduction at CRYPTO'94. We presen...
Abstract. In this work we consider generic algorithms to find near-collisions for a hash function. I...
Hash functions are often used to consistently assign objects to particular resources, for example t...
Abstract. The hash function HAVAL is an Australian extension of well known Merkle-Damg˚ard hash func...
Title: Security and usability of standard hash functions, in particular MD-5, SHA-1 and SHA-2 Author...
. This paper presents an attack on Gong's proposed collisionful hash function. The weaknesses o...
Abstract. In this paper, we present new collision search attacks on the hash function SHA-1. We show...
We survey theory and applications of cryptographic hash functions, such as MD5 and SHA-1, especially...
Abstract. In this paper, we present new collision search attacks on the hash function SHA-1. We show...
Message Authentication Code (MAC) algorithms can provide cryptographically secure authentication ser...
Abstract. The design principle of Merkle-Damg˚ard construction is collision resistance of the compre...
In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions f...
Cryptographic hash functions compute a small fixed-size hash value for any given message. A main app...
Recent attacks on hash functions start by constructing a differential characteristic. By finding mes...
In this work we consider generic algorithms to find near-collisions for a hash function. If we consi...
The Zémor-Tillich hash function has remained unbroken since its introduction at CRYPTO'94. We presen...
Abstract. In this work we consider generic algorithms to find near-collisions for a hash function. I...
Hash functions are often used to consistently assign objects to particular resources, for example t...
Abstract. The hash function HAVAL is an Australian extension of well known Merkle-Damg˚ard hash func...
Title: Security and usability of standard hash functions, in particular MD-5, SHA-1 and SHA-2 Author...
. This paper presents an attack on Gong's proposed collisionful hash function. The weaknesses o...
Abstract. In this paper, we present new collision search attacks on the hash function SHA-1. We show...