This work deals with the classification, security and efficiency of generalized Feistel
networks (GFNs) with 4 lines. We propose a definition of a GFN, essentially limiting …

In this paper we propose the Grindahl hash functions, which are based on components of
the Rijndael algorithm. To make collision search sufficiently difficult, this design has the …

Cryptographic hash functions serve as a fundamental building block of information security
and are used in numerous security applications and protocols such as digital signature …

In this paper, we present the first results on the preimage resistance against step-reduced
versions of ISO standard hash functions RIPEMD-128 and RIPEMD-160, which were …

This paper advocates a new hash function family based on the HAIFA framework, inheriting
built-in randomized hashing and higher security guarantees than the Merkle-Damgård …

Due to recent breakthroughs in hash functions cryptanalysis, some new hash schemes have
been proposed. Grindahl is a novel hash function, designed by Knudsen, Rechberger and …

In this paper we study the security of summing the outputs of two independent hash
functions, in an effort to increase the security of the resulting design, or to hedge against the …

Abstract We show that a 2 112.9 collision attack exists against the FORK-256 Hash Function.
The attack is surprisingly simple compared to existing published FORK-256 cryptanalysis …

Abstract Information is an important commodity in the world of Electronic communication. To
achieve a secure communication between communicating parties, the protection of …

We describe preimage attacks on several double-branch hash functions. We first present
meet-in-the-middle preimage attacks on RIPEMD, whose output length is 128 bits and …