Add to ORKGWe present a brief report on the collision search for the reduced SHA-1. With a few improvements to the De Cannière-Rechberger automatic collision search method we managed to construct two new collisions for 72- and 73-step reduced SHA-1 hash function
The Keccak sponge function family, designed by Bertoni et al. in 2007, was selected by the U.S. Nati...
International audienceSHA-1 is a widely used 1995 NIST cryptographic hash function standard that was...
We present in this article a freestart collision example for SHA-1, i.e., a collision for its intern...
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...
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...
SHA-1 is a widely used 1995 NIST cryptographic hash function standard that was officially deprecated...
This is the first article analyzing the security of SHA-256 against fast collision search which cons...
Recent attacks on hash functions start by constructing a differential characteristic. By finding mes...
Abstract. In this work, we present practical semi-free-start collisions for SHA-512 on up to 38 (out...
Abstract. In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and...
This is the first article analyzing the security of SHA-256 against fast collision search which cons...
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 ...
The Keccak sponge function family, designed by Bertoni et al. in 2007, was selected by the U.S. Nati...
International audienceSHA-1 is a widely used 1995 NIST cryptographic hash function standard that was...
We present in this article a freestart collision example for SHA-1, i.e., a collision for its intern...
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...
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...
SHA-1 is a widely used 1995 NIST cryptographic hash function standard that was officially deprecated...
This is the first article analyzing the security of SHA-256 against fast collision search which cons...
Recent attacks on hash functions start by constructing a differential characteristic. By finding mes...
Abstract. In this work, we present practical semi-free-start collisions for SHA-512 on up to 38 (out...
Abstract. In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and...
This is the first article analyzing the security of SHA-256 against fast collision search which cons...
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 ...
The Keccak sponge function family, designed by Bertoni et al. in 2007, was selected by the U.S. Nati...
International audienceSHA-1 is a widely used 1995 NIST cryptographic hash function standard that was...
We present in this article a freestart collision example for SHA-1, i.e., a collision for its intern...