Cayley hash functions are cryptographic hashes constructed from Cayley graphs of groups. The hash function proposed by Shpilrain and Sosnovski (2016), based on linear functions over a finite field, was proven insecure. This paper shows that the proposal by Ghaffari and Mostaghim (2018) that uses the Shpilrain and Sosnovski's hash in its construction is also insecure. We demonstrate its security vulnerability by constructing collisions.

翻译：Cayley哈希函数是由群的Cayley图构造的密码哈希函数。Shpilrain与Sosnovski（2016年）提出的基于有限域上线性函数的哈希方案已被证明存在安全缺陷。本文证明，Ghaffari与Mostaghim（2018年）在构造中采用Shpilrain和Sosnovski哈希的方案同样存在安全隐患。我们通过构造碰撞实例揭示了其安全脆弱性。