Abstract
We propose a new family of hash functions based on computations over a finite field of characteristic 2. These functions can be computed quickly, detect small modifications of the input text, and their security is equivalent to a precise mathematical problem. They rely on the arithmetic of the group of matrices SL 2, and improve upon previous functions based on the same strategy.
Chapter PDF
Similar content being viewed by others
References
Babai, L., Kantor, W. M., Lubotsky, A: Small-diameter Cayley graphs for finite simple groups. Europ. J. of Combinatorics 10 (1989) 507–522
Bosset, J: Contre les risques d’altération, un système de certifications des informations. 01 Informatique (1977)
Camion, P: Can a fast signature scheme without secret key be secure? In proc. AAECC (1987) Springer-Verlag Lec. N. Comp. Sci. 228 pp. 187–196
Dickson, L: Linear groups with an exposition of the Galois field theory. Dover New York 1958
Jerrum, M. R: The complexity of finding minimum length generator sequences. Theoretical Computer Science 36 (1985) 265–289
J. Lafferty, Rockmore, D: Numerical investigation of the spectrum for certain families of cayley graphs. In 1992 DIMACS Workshop on expanders graphs (1993) D. S. in Disc. Math., T. C. S. in Discrete Mathematics, and T. C. Science, Eds. pp. 63–74
Margulis, G. A: Explicit constructions of graphs without short cycles and low density codes. COMBINATORICA 2 (1982) 71–78
Margulis, G. A: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problemy Peredachi Informatsii 24 (1988) 51–60
Sarnack, P: Some applications of modular forms. Cambridge University Press 1990
Suzuki, M: Group theory, volume I. Springer-Verlag 1982
Tillich, J.-P., Zémor, G: Group-theoretic hash functions. In First French-Israeli workshop on algebraic coding (1994) Springer-Verlag Lec. N. Comp. Sci. 781 pp. 90–110
Zémor, G: Hash functions and Cayley graphs. To appear in Designs, Codes and Cryptography
Zémor, G: Hash functions and graphs with large girths. In EUROCRYPT 91 (1991) LNCS 547 Springer-Verlag pp. 508–511
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tillich, JP., Zémor, G. (1994). Hashing with SL 2 . In: Desmedt, Y.G. (eds) Advances in Cryptology — CRYPTO ’94. CRYPTO 1994. Lecture Notes in Computer Science, vol 839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48658-5_5
Download citation
DOI: https://doi.org/10.1007/3-540-48658-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58333-2
Online ISBN: 978-3-540-48658-9
eBook Packages: Springer Book Archive