International audienceAt CRYPTO 2012, Knellwolf and Khovratovich presented a differential formulation of advanced meet-in-the-middle techniques for preimage attacks on hash functions. They demonstrated the usefulness of their approach by significantly improving the previously best known attacks on SHA-1 from CRYPTO 2009, increasing the number of attacked rounds from a 48-round one-block pseudo-preimage without padding and a 48-round two-block preimage without padding to a 57-round one-block preimage without padding and a 57-round two-block preimage with padding, out of 80 rounds for the full function. In this work, we exploit further the differential view of meet-in-the-middle techniques and generalize it to higher-order differentials. Desp...
This research explores the problem of finding a preimage — an input that, when passed through a part...
On October 2-nd 2012 NIST announced its selection of the Keccak scheme as the new SHA-3 hash standar...
Abstract. In this work, we introduce a new non-random property for hash/compression functions using ...
International audienceAt CRYPTO 2012, Knellwolf and Khovratovich presented a differential formulatio...
International audienceAt CRYPTO 2012, Knellwolf and Khovratovich presented a differential formulatio...
International audienceAt CRYPTO 2012, Knellwolf and Khovratovich presented a differential formulatio...
Abstract. At CRYPTO 2012, Knellwolf and Khovratovich presented a differential formulation of advance...
We revisit narrow-pipe designs that are in practical use, and their security against preimage attack...
We revisit narrow-pipe designs that are in practical use, and their security against preimage attack...
Abstract. We revisit narrow-pipe designs that are in practical use, and their security against preim...
The Grøstl hash function is one of the five finalists in the third round of SHA-3 competition hosted...
Hashing modes are ways to convert a block cipher into a hash function, and those with AES as the und...
The Meet-in-the-Middle (MitM) attack has been widely applied to preimage attacks on Merkle-Damg{\aa}...
The Grøstl hash function is one of the 5 final round candidates of the SHA-3 competition hosted by N...
Abstract. This paper presents improved collision attacks on round-reduced variants of the hash funct...
This research explores the problem of finding a preimage — an input that, when passed through a part...
On October 2-nd 2012 NIST announced its selection of the Keccak scheme as the new SHA-3 hash standar...
Abstract. In this work, we introduce a new non-random property for hash/compression functions using ...
International audienceAt CRYPTO 2012, Knellwolf and Khovratovich presented a differential formulatio...
International audienceAt CRYPTO 2012, Knellwolf and Khovratovich presented a differential formulatio...
International audienceAt CRYPTO 2012, Knellwolf and Khovratovich presented a differential formulatio...
Abstract. At CRYPTO 2012, Knellwolf and Khovratovich presented a differential formulation of advance...
We revisit narrow-pipe designs that are in practical use, and their security against preimage attack...
We revisit narrow-pipe designs that are in practical use, and their security against preimage attack...
Abstract. We revisit narrow-pipe designs that are in practical use, and their security against preim...
The Grøstl hash function is one of the five finalists in the third round of SHA-3 competition hosted...
Hashing modes are ways to convert a block cipher into a hash function, and those with AES as the und...
The Meet-in-the-Middle (MitM) attack has been widely applied to preimage attacks on Merkle-Damg{\aa}...
The Grøstl hash function is one of the 5 final round candidates of the SHA-3 competition hosted by N...
Abstract. This paper presents improved collision attacks on round-reduced variants of the hash funct...
This research explores the problem of finding a preimage — an input that, when passed through a part...
On October 2-nd 2012 NIST announced its selection of the Keccak scheme as the new SHA-3 hash standar...
Abstract. In this work, we introduce a new non-random property for hash/compression functions using ...