1 research outputs found
Cayley Graphs of Semigroups and Applications to Hashing
In 1994, Tillich and Zemor proposed a scheme for a family of hash functions that uses products of matrices in groups of the form . In 2009, Grassl et al. developed an attack to obtain collisions for palindromic bit strings by exploring a connection between the Tillich-Zemor functions and maximal length chains in the Euclidean algorithm for polynomials over .
In this work, we present a new proposal for hash functions based on Cayley graphs of semigroups. In our proposed hash function, the noncommutative semigroup of linear functions under composition is considered as platform for the scheme. We will also discuss its efficiency, pseudorandomness and security features.
Furthermore, we generalized the Fit-Florea and Matula\u27s algorithm (2004) that finds the discrete logarithm in the multiplicative group of integers modulo by establishing a connection between semi-primitive roots modulo where and the logarithmic base used in the algorithm