Skip to main content
Springer Nature Link
Log in

Attacking the SL 2 hashing scheme

  • Conference paper
  • First Online:
Advances in Cryptology — ASIACRYPT'94 (ASIACRYPT 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 917))

Included in the following conference series:

  • 248 Accesses

Abstract

Tillich and Zémor proposed a definition of a new hash function which uses SL 2(2, 2n), the group of unimodular two-dimensional matrices with entries in GF(2n, to compute the hash values of binary strings. This hashing scheme has several attractive features; hash values can be computed quickly and small modifications to the input text can be detected. However, this scheme is weak. Using a group theoretic argument we are able to produce two distinct binary strings of small length which hash to the same value in SL 2(2,2n) for the range specified by Tillich and Zémor.

Support for this project was provided in part by the Australian Research Council under the reference number A49131885

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Brillhart et al. Factorizations of bn ±1 b = 2,3,5,6,7,10,11,12 up to high powers. Contemp. Math. Vol. 22, 2nd ed. 1988 Amer. Math. Society.

    Google Scholar 

  2. C. Charnes and J. Pieprzyk. The Dihedral subgroup attack on the SL2 hash function. (In preparation.)

    Google Scholar 

  3. L. Dornhoff. Group Representation Theory Vol. 1. 1971 Marcel Dekker, Inc., New York.

    Google Scholar 

  4. M. Schönert et al. GAP Groups, Algorithms and Programming 3.3. Lehrstuhl D für Mathematik, RWTH Aachen, 1993.

    Google Scholar 

  5. L. Babai, W.M. Kantor, and A. Lubotsky. Small-diameter Cayley graphs for finite simple groups. Europ. J. of Combinatorics, Vol. 10, pp. 507–552, 1989.

    Google Scholar 

  6. J-P. Tillich and G. Zémor. Hashing with SL 2. Proceedings of CRYPTO'94, Yvo G. Desmet (Ed.) LNCS Vol. 839, Springer-Verlag, pp. 40–49, 1994.

    Google Scholar 

  7. G. Zémor. Hash Functions and Cayley Graphs. Designs, Codes and Cryptography Vol. 4, pp. 381–394, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Computer Security Research Department of Computer Science, University of Wollongong, Northfields Ave., 2522, Wollongong, NSW, Australia

    Chris Charnes & Josef Pieprzyk

Authors
  1. Chris Charnes
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Josef Pieprzyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josef Pieprzyk Reihanah Safavi-Naini

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Charnes, C., Pieprzyk, J. (1995). Attacking the SL 2 hashing scheme. In: Pieprzyk, J., Safavi-Naini, R. (eds) Advances in Cryptology — ASIACRYPT'94. ASIACRYPT 1994. Lecture Notes in Computer Science, vol 917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000444

Download citation

  • DOI: https://doi.org/10.1007/BFb0000444

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59339-3

  • Online ISBN: 978-3-540-49236-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation