In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions for the FORK-256 hash function was presented [8]. The paper contained examples of near-collisions for the compression function, but in practice the attack could not be extended to the full function due to large memory requirements and computation time. In this paper we improve the attack and show that it is possible to find near-collisions in practice for any given value of IV. In particular, this means that the full hash function with the prespecified IV is vulnerable in practice, not just in theory. We exhibit an example near-collision for the complete hash function.10 page(s
In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complemen...
Knudsen and Preneel (Asiacrypt'96 and Crypto'97) introduced a hash function design in which a linear...
Over the last two or three years there has been a huge amount of interest in hash-function specific ...
In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions f...
Abstract. This report presents analysis of the compression function of a recently proposed hash func...
In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong ...
© Springer-Verlag Berlin Heidelberg 2007. FORK-256 is a hash function presented at FSE 2006. Whereas...
The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 c...
We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson...
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...
Abstract. In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and...
The Zémor-Tillich hash function has remained unbroken since its introduction at CRYPTO'94. We presen...
In this work we consider generic algorithms to find near-collisions for a hash function. If we consi...
Abstract. We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 b...
In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complemen...
Knudsen and Preneel (Asiacrypt'96 and Crypto'97) introduced a hash function design in which a linear...
Over the last two or three years there has been a huge amount of interest in hash-function specific ...
In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions f...
Abstract. This report presents analysis of the compression function of a recently proposed hash func...
In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong ...
© Springer-Verlag Berlin Heidelberg 2007. FORK-256 is a hash function presented at FSE 2006. Whereas...
The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 c...
We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson...
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...
Abstract. In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and...
The Zémor-Tillich hash function has remained unbroken since its introduction at CRYPTO'94. We presen...
In this work we consider generic algorithms to find near-collisions for a hash function. If we consi...
Abstract. We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 b...
In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complemen...
Knudsen and Preneel (Asiacrypt'96 and Crypto'97) introduced a hash function design in which a linear...
Over the last two or three years there has been a huge amount of interest in hash-function specific ...