Access the full text.
Sign up today, get DeepDyve free for 14 days.
Electronics, Circuits and Systems – ICECS 2008
J. Cassaigne, T. Harju, J. Karhumäki (1999)
On the Undecidability of Freeness of Matrix SemigroupsInt. J. Algebra Comput., 9
C. Petit, Nicolas Veyrat-Charvillon, J. Quisquater (2008)
Efficiency and pseudo-randomness of a variant of Zémor-Tillich hash function2008 15th IEEE International Conference on Electronics, Circuits and Systems
Ciaran Mullan, B. Tsaban (2013)
SL2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\text {SL}}_2$$\end{document} homomorphic hash functions: worst caDesigns, Codes and Cryptography, 81
V. Shpilrain, Bianca Sosnovski (2015)
Compositions of linear functions and applications to hashingGroups Complexity Cryptology, 8
J. Tillich, G. Zémor (1994)
Hashing with SL_2
Advances in Cryptology – CRYPTO ’94
AbstractIn 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.
Groups Complexity Cryptology – de Gruyter
Published: May 1, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.