© Springer-Verlag Berlin Heidelberg 2007. FORK-256 is a hash function presented at FSE 2006. Whereas SHA-like designs process messages in one stream, FORK-256 uses four parallel streams for hashing. In this article, we present the first cryptanalytic results on this design strategy. First, we study a linearized variant of FORK-256, and show several unusual properties of this linearized variant. We also explain why the linearized model can not be used to mount attacks similar to the recent attacks by Wang et al. on SHA-like hash functions. Second, we show how collision attacks, exploiting the non-bijectiveness of the nonlinear functions of FORK-256, can be mounted on reduced variants of FORK-256. We show an efficient attack on FORK-256 reduc...
The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 c...
This thesis deals with the analysis and design of cryptographic hash functions that are fundamental ...
Abstract. In this work, we introduce a new non-random property for hash/compression functions using ...
In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong ...
Abstract. This report presents analysis of the compression function of a recently proposed hash func...
In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions f...
Cryptographic hash functions compute a small fixed-size hash value for any given message. A main app...
In recent years there have been a series of serious and alarming cryptanalytic attacks on several co...
Abstract. The design principle of Merkle-Damg˚ard construction is collision resistance of the compre...
A function that compresses an arbitrarily large message into a fixed small size ‘message digest’ is ...
A function that compresses an arbitrarily large message into a fixed small size ‘message digest’ is ...
Abstract: In this paper we analyse the role of some of the building blocks of SHA-256. We show that ...
Cryptographic hash functions serve as a fundamental building block of information security and are u...
In this paper we analyse the role of some of the building blocks of SHA-256. We show that the distur...
A hash function is a function taking as argument an element of finite arbitrary length and returning...
The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 c...
This thesis deals with the analysis and design of cryptographic hash functions that are fundamental ...
Abstract. In this work, we introduce a new non-random property for hash/compression functions using ...
In this paper we present a cryptanalysis of a new 256-bit hash function, FORK-256, proposed by Hong ...
Abstract. This report presents analysis of the compression function of a recently proposed hash func...
In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions f...
Cryptographic hash functions compute a small fixed-size hash value for any given message. A main app...
In recent years there have been a series of serious and alarming cryptanalytic attacks on several co...
Abstract. The design principle of Merkle-Damg˚ard construction is collision resistance of the compre...
A function that compresses an arbitrarily large message into a fixed small size ‘message digest’ is ...
A function that compresses an arbitrarily large message into a fixed small size ‘message digest’ is ...
Abstract: In this paper we analyse the role of some of the building blocks of SHA-256. We show that ...
Cryptographic hash functions serve as a fundamental building block of information security and are u...
In this paper we analyse the role of some of the building blocks of SHA-256. We show that the distur...
A hash function is a function taking as argument an element of finite arbitrary length and returning...
The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 c...
This thesis deals with the analysis and design of cryptographic hash functions that are fundamental ...
Abstract. In this work, we introduce a new non-random property for hash/compression functions using ...