Abstract. In this paper we extend the herding attacks for concatenated hash functions, i.e., hash functions of the form h(x) = h1(x)||h2(x). Our results actually apply a much larger set of hash functions. We show that even when the compression function of h(·) can be written as two (or more) data paths, where one data path is not affected by the second (while the second may depend on the first), then the generalized herding attack can be applied. This result along with Joux’s original observations show that schemes that aim to improve the resistance of hash functions against these attacks, must use diffusion between the various data paths
Abstract The design principles proposed independently by both Ralph Merkle and Ivan Damgård in 1989 ...
We apply combinatorics on words to develop an approach to multicollisions in generalized iterated ha...
We introduce a statistical experiment setting to carry out a multicollision attack on any iterated h...
Abstract. In this paper, we develop a new attack on Damg̊ard-Merkle hash functions, called the herdi...
This paper deals with definitional aspects of the herding attack of Kelsey and Kohno, and investigat...
Abstract. At SAC 2006, Liskov proposed the zipper hash, a technique for constructing secure (indiffe...
Abstract. In this paper we present new attack techniques to analyze the structure of hash functions ...
Chosen-target-forced-prefix (CTFP) preimage resistance is a hash function security property guarante...
We analyse the security of iterated hash functions that compute an input dependent checksum which is...
International audienceIn this paper we present new attack techniques to analyze the structure of has...
In this paper, we analyze the complexity of the construction of the 2k-diamond structure proposed by...
At SAC 2006, Liskov proposed the zipper hash, a technique for constructing secure (indifferentiable ...
In this thesis, we study hash functions. We focus mainly on the famous Merkle-Damg˚ard construction ...
Hash functions are an invaluable tool for cryptography. They must primarily satisfy collision resist...
In a recent paper in crypto-04, A. Joux [6] showed a multicollision attacks on the classical iterat...
Abstract The design principles proposed independently by both Ralph Merkle and Ivan Damgård in 1989 ...
We apply combinatorics on words to develop an approach to multicollisions in generalized iterated ha...
We introduce a statistical experiment setting to carry out a multicollision attack on any iterated h...
Abstract. In this paper, we develop a new attack on Damg̊ard-Merkle hash functions, called the herdi...
This paper deals with definitional aspects of the herding attack of Kelsey and Kohno, and investigat...
Abstract. At SAC 2006, Liskov proposed the zipper hash, a technique for constructing secure (indiffe...
Abstract. In this paper we present new attack techniques to analyze the structure of hash functions ...
Chosen-target-forced-prefix (CTFP) preimage resistance is a hash function security property guarante...
We analyse the security of iterated hash functions that compute an input dependent checksum which is...
International audienceIn this paper we present new attack techniques to analyze the structure of has...
In this paper, we analyze the complexity of the construction of the 2k-diamond structure proposed by...
At SAC 2006, Liskov proposed the zipper hash, a technique for constructing secure (indifferentiable ...
In this thesis, we study hash functions. We focus mainly on the famous Merkle-Damg˚ard construction ...
Hash functions are an invaluable tool for cryptography. They must primarily satisfy collision resist...
In a recent paper in crypto-04, A. Joux [6] showed a multicollision attacks on the classical iterat...
Abstract The design principles proposed independently by both Ralph Merkle and Ivan Damgård in 1989 ...
We apply combinatorics on words to develop an approach to multicollisions in generalized iterated ha...
We introduce a statistical experiment setting to carry out a multicollision attack on any iterated h...