Abstract. The starting point for collision attacks on practical hash functions is a local collision. In this paper, we make a systematic study of local collisions for the SHA-2 family. The possible linear approximations of the constituent Boolean functions are considered and certain impossible conditions for such approximations are identified. Based on appropriate approximations, we describe a general method for finding local collisions. Applying this method, we obtain several local collisions and compute the probabilities of the various differential paths. Previously, only one local collision due to Gilbert-Handschuh was known. We point out two impossible conditions in the GH local collision and provide an example of an impossible differen...
SHA-1 is a widely used cryptographic hashing algorithm for validating the integrity of data. Until r...
Abstract. In this paper we describe improvements to the techniques used to cryptanalyze SHA-0 and in...
Recent progress in hash functions analysis has led to collisions on reduced versions of SHA-256. As ...
The main contributions of this paper are two-fold. Firstly, we present a novel direction in the ...
Abstract. In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and...
Abstract. In this paper, we present new collision search attacks on the hash function SHA-1. We show...
Abstract. In this paper, we present new collision search attacks on the hash function SHA-1. We show...
Recent attacks on hash functions start by constructing a differential characteristic. By finding mes...
Abstract. The design principle of Merkle-Damg˚ard construction is collision resistance of the compre...
The Keccak sponge function family, designed by Bertoni et al. in 2007, was selected by the U.S. Nati...
Abstract. In this work, we present practical semi-free-start collisions for SHA-512 on up to 38 (out...
This is the first article analyzing the security of SHA-256 against fast collision search which cons...
Abstract. This paper presents improved collision attacks on round-reduced variants of the hash funct...
The Keccak hash function is the winner of the SHA-3 competition (2008–2012) and became the SHA-3 sta...
In this paper, we present a collision attack on the SHA-3 submission SHAMATA. SHAMATA is a stream ci...
SHA-1 is a widely used cryptographic hashing algorithm for validating the integrity of data. Until r...
Abstract. In this paper we describe improvements to the techniques used to cryptanalyze SHA-0 and in...
Recent progress in hash functions analysis has led to collisions on reduced versions of SHA-256. As ...
The main contributions of this paper are two-fold. Firstly, we present a novel direction in the ...
Abstract. In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and...
Abstract. In this paper, we present new collision search attacks on the hash function SHA-1. We show...
Abstract. In this paper, we present new collision search attacks on the hash function SHA-1. We show...
Recent attacks on hash functions start by constructing a differential characteristic. By finding mes...
Abstract. The design principle of Merkle-Damg˚ard construction is collision resistance of the compre...
The Keccak sponge function family, designed by Bertoni et al. in 2007, was selected by the U.S. Nati...
Abstract. In this work, we present practical semi-free-start collisions for SHA-512 on up to 38 (out...
This is the first article analyzing the security of SHA-256 against fast collision search which cons...
Abstract. This paper presents improved collision attacks on round-reduced variants of the hash funct...
The Keccak hash function is the winner of the SHA-3 competition (2008–2012) and became the SHA-3 sta...
In this paper, we present a collision attack on the SHA-3 submission SHAMATA. SHAMATA is a stream ci...
SHA-1 is a widely used cryptographic hashing algorithm for validating the integrity of data. Until r...
Abstract. In this paper we describe improvements to the techniques used to cryptanalyze SHA-0 and in...
Recent progress in hash functions analysis has led to collisions on reduced versions of SHA-256. As ...