Add to ORKGThe cryptanalysis of the cryptographic hash function Tiger [AB96] has, until now, focussed on finding collisions [KL06, M+06]. In this paper we describe a preimage attack on the com-pression function of Tiger-12 (i.e. Tiger reduced to 12 rounds out of 24) with a complexity of 263.5 compression function evaluations. We show how this can be used to construct second preimages (complexity 263.5) and first preimages (complexity 264.5) for Tiger-12. These attacks can also be extended to Tiger-13 at the expense of an additional factor 264 in complexity
The Grøstl hash function is one of the five finalists in the third round of SHA-3 competition hosted...
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...
Abstract. The cryptanalysis of the cryptographic hash function Tiger has, until now, focussed on fin...
Tiger is a cryptographic hash function with a 192-bit hash value. It was proposed by Anderson and Bi...
Abstract. This paper shows new preimage attacks on reduced Tiger and SHA-2. Indesteege and Preneel p...
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...
Abstract. In August 2012, the Stribog hash function was selected as the new Russian cryptographic ha...
In this paper we present concrete collision and preimage attacks on a large class of compression fun...
In this paper we present concrete collision and preimage attacks on a large class of compression fun...
After 15 years of unsuccessful cryptanalysis attempts by the research community, Grassl et al. have ...
Abstract. In this paper, we present improved preimage attacks on the reduced-round GOST hash functio...
Abstract. Knudsen and Preneel (Asiacrypt’96 and Crypto’97) introduced a hash function design in whic...
The Grøstl hash function is one of the five finalists in the third round of SHA-3 competition hosted...
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...
Abstract. The cryptanalysis of the cryptographic hash function Tiger has, until now, focussed on fin...
Tiger is a cryptographic hash function with a 192-bit hash value. It was proposed by Anderson and Bi...
Abstract. This paper shows new preimage attacks on reduced Tiger and SHA-2. Indesteege and Preneel p...
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...
Abstract. In August 2012, the Stribog hash function was selected as the new Russian cryptographic ha...
In this paper we present concrete collision and preimage attacks on a large class of compression fun...
In this paper we present concrete collision and preimage attacks on a large class of compression fun...
After 15 years of unsuccessful cryptanalysis attempts by the research community, Grassl et al. have ...
Abstract. In this paper, we present improved preimage attacks on the reduced-round GOST hash functio...
Abstract. Knudsen and Preneel (Asiacrypt’96 and Crypto’97) introduced a hash function design in whic...
The Grøstl hash function is one of the five finalists in the third round of SHA-3 competition hosted...
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...