Cryptanalysis of a Cayley Hash Function Based on Affine Maps in one Variable over a Finite Field

08/30/2023
βˆ™
by   Bianca Sosnovski, et al.
βˆ™
0
βˆ™

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 07/08/2022

Post-quantum hash functions using SL_n(𝔽_p)

We define new families of Tillich-ZΓ©mor hash functions, using higher dim...
research
βˆ™ 11/02/2011

Kernel diff-hash

This paper presents a kernel formulation of the recently introduced diff...
research
βˆ™ 07/29/2018

SHAH: Hash Function based on Irregularly Decimated Chaotic Map

In this paper, we propose a novel hash function based on irregularly dec...
research
βˆ™ 03/15/2019

Hash functions from superspecial genus-2 curves using Richelot isogenies

Last year Takashima proposed a version of Charles, Goren and Lauter's ha...
research
βˆ™ 06/07/2023

Ξ΅-Almost collision-flat universal hash functions and mosaics of designs

We introduce, motivate and study Ξ΅-almost collision-flat (ACFU) universa...
research
βˆ™ 02/14/2019

GPU Accelerated Keccak (SHA3) Algorithm

Hash functions like SHA-1 or MD5 are one of the most important cryptogra...
research
βˆ™ 01/08/2019

Using fuzzy bits and neural networks to partially invert few rounds of some cryptographic hash functions

We consider fuzzy, or continuous, bits, which take values in [0;1] and (...

Please sign up or login with your details

Forgot password? Click here to reset