More secure version of a Cayley hash function

Abstract

In this paper, we propose a more secure version of a Cayley hash function which is based on the linear functions. It is a practical parallelizable hash function.

Recent Developments in Cayley Hash Functions

“…This paper proves that the hash function proposed by Gaffari and Mustaghim [6] is not collision-resistant, which uses the hash proposed by Shpilrain and Sosnovski [16] that has been proven insecure by Monico [10]. To show that Gaffari and Mustaghim's is also insecure, we apply Monico's algorithm to find second-preimages for the Shpilrain-Sosnovski hash function to produce collisions for the Gaffari and Mustaghim's hash function.…”

“…To make the factorization problem harder, Ghaffari and Mostaghim [6] suggested the following variation. Let G the group generated by f 0 and f 1 over Z p , t > 1 an integer and g ∈ G \ {e, f 0 , f 1 }, where e is the identity element of G.…”