Abstract
The hash function based on the group SL2(\(F_{2^n }\)) [4] is studied by embedding the generators of SL2(\(F_{2^n }\)) into finite fields. Using this embeddings, clashing sequences can be found by calculationg discrete logarithms in the field \(F_{2^n }\).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Charnes, J.Pieprzyk; Attacking the SL2 Hashing Scheme; Proceedings of ASIA-CRYPT '94, J.Pieprzyk (Ed.), LNCS, Springer, pp. 268–276.
W. Geiselmann, D. Gollmann; Self-Dual Basis in \(F_{q^n }\); Designs, Codes and Cryptography, Vol. 3, No. 4, pp. 333–345, 1993.
R. Lidl, H. Niederreiter; Introduction to Finite Fields and Their Applications; Cambridge University Press, 1986.
J-P. Tillich, G.Zémor; Hashing with 263–02; Proceedings of CRYPTO '94, Y. Desmet (Ed.), LNCS Vol 839, Springer, pp. 40–49, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geiselmann, W. (1995). A note on the hash function of Tillich and Zémor. In: Boyd, C. (eds) Cryptography and Coding. Cryptography and Coding 1995. Lecture Notes in Computer Science, vol 1025. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60693-9_27
Download citation
DOI: https://doi.org/10.1007/3-540-60693-9_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60693-2
Online ISBN: 978-3-540-49280-1
eBook Packages: Springer Book Archive