Home More secure version of a Cayley hash function
Article
Licensed
Unlicensed Requires Authentication

More secure version of a Cayley hash function

  • Mohammad Hossein Ghaffari ORCID logo and Zohreh Mostaghim ORCID logo EMAIL logo
Published/Copyright: April 13, 2018
Become an author with De Gruyter Brill
Author Information Explore this Subject
Groups Complexity Cryptology
From the journal Groups Complexity Cryptology Volume 10 Issue 1

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.

Keywords: Cayley hash function; linear function; Cayley graph; hash function
MSC 2010: 94A60; 05C25; 20G40

References

[1] J. Cassaigne, T. Harju and J. Karhumäki, On the undecidability of freeness of matrix semigroups, Internat. J. Algebra Comput. 9 (1999), no. 3–4, 295–305. 10.1142/S0218196799000199Search in Google Scholar

[2] C. Mullan and B. Tsaban, SL2 homomorphic hash functions: Worst case to average case reduction and short collision search, Des. Codes Cryptogr. 81 (2016), no. 1, 83–107. 10.1007/s10623-015-0129-8Search in Google Scholar

[3] C. Petit, N. Veyrat-Charvillon and J.-J. Quisquater, Efficiency and pseudo-randomness of a variant of Zémor–Tillich hash function, Electronics, Circuits and Systems – ICECS 2008, IEEE Press, Piscataway (2008), 906–909. 10.1109/ICECS.2008.4675001Search in Google Scholar

[4] V. Shpilrain and B. Sosnovski, Compositions of linear functions and applications to hashing, Groups Complex. Cryptol. 8 (2016), no. 2, 155–161. 10.1515/gcc-2016-0016Search in Google Scholar

[5] J.-P. Tillich and G. Zémor, Hashing with SL2, Advances in Cryptology – CRYPTO ’94 (Santa Barbara 1994), Lecture Notes in Comput. Sci. 839, Springer, Berlin (1994), 40–49. 10.1007/3-540-48658-5_5Search in Google Scholar

[6] The Sage Developers, SageMath, the Sage Mathematics Software System (Version 8.1), 2017, http://www.sagemath.org. Search in Google Scholar

Received: 2017-9-11
Published Online: 2018-4-13
Published in Print: 2018-5-1

© 2018 Walter de Gruyter GmbH, Berlin/Boston

Articles in the same Issue

  1. Frontmatter
  2. Analysis of secret sharing schemes based on Nielsen transformations
  3. The word problem of ℤn is a multiple context-free language
  4. Practical private-key fully homomorphic encryption in rings
  5. More secure version of a Cayley hash function
  6. Certifying numerical estimates of spectral gaps
  7. Orderable groups, elementary theory, and the Kaplansky conjecture
https://doi.org/10.1515/gcc-2018-0002
Keywords for this article
Cayley hash function; linear function; Cayley graph; hash function

Articles in the same Issue

  1. Frontmatter
  2. Analysis of secret sharing schemes based on Nielsen transformations
  3. The word problem of ℤn is a multiple context-free language
  4. Practical private-key fully homomorphic encryption in rings
  5. More secure version of a Cayley hash function
  6. Certifying numerical estimates of spectral gaps
  7. Orderable groups, elementary theory, and the Kaplansky conjecture
Sign up now to receive a 20% welcome discount
Institutional Access
How does access work?
Have an idea on how to improve our website?
Please write us.
© 2025 De Gruyter Brill
Downloaded on 25.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/gcc-2018-0002/html?lang=en
Scroll to top button