International audienceECHO-256 is a second-round candidate of the SHA-3 competition. It is an AES-based hash function that has attracted a lot of interest and analysis. Up to now, the best known attacks were a distinguisher on the full internal permutation and a collision on four rounds of its compression function. The latter was the best known analysis on the compression function as well as the one on the largest number of rounds so far. In this paper, we extend the compression function results to get a distinguisher on 7 out of 8 rounds using rebound techniques. We also present the first 5-round collision attack on the ECHO-256 hash function
Abstract. In this work, we introduce a new non-random property for hash/compression functions using ...
This paper presents the first non-trivial collision attack on the double-block-length compression fu...
Abstract. AES-based functions have attracted of a lot of analysis in the recent years, mainly due to...
Abstract. In this paper, we present new results on the second-round SHA-3 candidate ECHO. We describ...
Abstract. In this paper, we present new results on the second-round SHA-3 candidate ECHO. We describ...
International audienceGrøstl is one of the five finalist hash functions of the SHA-3 competition. Fo...
In this work we present first results for the hash function of ECHO. We provide a subspace distingui...
Abstract. Grøstl is one of the five finalist hash functions of the SHA-3 competition. For entering t...
We analyze the Grøstl hash function, which is a 2nd-round candidate of the SHA-3 competition. Using ...
In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function L...
The hash function Kupyna was recently published as the Ukrainian standard DSTU 7564:2014. It is stru...
In this paper, we analyze the SHAvite-3-512 hash function, as proposed and tweaked for round 2 of th...
In this paper, we analyze the SHAvite-3-512 hash function, as proposed and tweaked for round 2 of th...
In this paper, we improve the recent rebound and start-from-the-middle attacks on AES-like permutati...
In this paper, we present a collision attack on the SHA-3 submission SHAMATA. SHAMATA is a stream ci...
Abstract. In this work, we introduce a new non-random property for hash/compression functions using ...
This paper presents the first non-trivial collision attack on the double-block-length compression fu...
Abstract. AES-based functions have attracted of a lot of analysis in the recent years, mainly due to...
Abstract. In this paper, we present new results on the second-round SHA-3 candidate ECHO. We describ...
Abstract. In this paper, we present new results on the second-round SHA-3 candidate ECHO. We describ...
International audienceGrøstl is one of the five finalist hash functions of the SHA-3 competition. Fo...
In this work we present first results for the hash function of ECHO. We provide a subspace distingui...
Abstract. Grøstl is one of the five finalist hash functions of the SHA-3 competition. For entering t...
We analyze the Grøstl hash function, which is a 2nd-round candidate of the SHA-3 competition. Using ...
In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function L...
The hash function Kupyna was recently published as the Ukrainian standard DSTU 7564:2014. It is stru...
In this paper, we analyze the SHAvite-3-512 hash function, as proposed and tweaked for round 2 of th...
In this paper, we analyze the SHAvite-3-512 hash function, as proposed and tweaked for round 2 of th...
In this paper, we improve the recent rebound and start-from-the-middle attacks on AES-like permutati...
In this paper, we present a collision attack on the SHA-3 submission SHAMATA. SHAMATA is a stream ci...
Abstract. In this work, we introduce a new non-random property for hash/compression functions using ...
This paper presents the first non-trivial collision attack on the double-block-length compression fu...
Abstract. AES-based functions have attracted of a lot of analysis in the recent years, mainly due to...