In this article, we present an improved collision attack on the hash function proposed by Shin et al. at PKC’98. The attack has a complexity of about 2 hash computations, while the previous attack of Chang et al. presented at SAC 2002 has a complexity of about 2 hash computations. In the analysis of the hash function we combined existing approaches with recent results in cryptanalysis of hash f...

RC4-Hash is a variable digest length cryptographic hash function based on the design of the RC4 stream cipher. In this paper, we show that RC4-Hash is not collision resistant. Collisions for any digest length can be found with an expected effort of less than 2 compression function evaluations. This is extended to multicollisions for RC4-Hash. Finding a set of 2 colliding messages has an expecte...

1 This paper presents a new hash function design, which is different from the popular designs of the MD4-family. Seen in the light of recent attacks on MD4, MD5, SHA-0, SHA-1, and on RIPEMD, there is a need to consider other hash function design strategies. The paper presents also a concrete hash function design named SMASH. One version has a hash code of 256 bits and appears to be at least as ...

Describing configuration spaces of 1-degree-of-freedom (1-dof) linkages in 2D is a difficult problem with a long history. We use the Cayley configuration space, a set of intervals of possible distance-values for an independent non-edge. We study the following complexity measures (associated with the linkage’s underlying graph): (a) Cayley size, i.e., the number of intervals, (b) Cayley computat...

In this paper, we propose a novel hash function based on irregularly decimated chaotic map. The called SHAH is two Tinkerbell maps filtered with irregular decimation rule. Exact study has been provided the scheme using distribution analysis, sensitivity static analysis of diffusion and confusion, collision analysis. experimental data show that satisfied admirable level security.

where M is the input message and h is the hash generated by the hash algorithm H . Normally, the size of the hash h is fixed by the algorithm. For a cryptographic hash function, the hash length should be large enough to prevent an attack from finding two or more messages that generate the same hash. Currently, the most commonly used hash algorithms are MD5 [1] and SHA-2 [2]. In general, the cry...