Attacking the SL2 hashing scheme

Chris Charnes, Josef Pieprzyk

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

12 Citations (Scopus)

Abstract

Tillich and Zemor proposed a definition of a new hash function which uses SL2(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 SL2(2,2n) for the range specified by Tillich and Zémor.

Original languageEnglish
Title of host publicationAdvances in Cryptology - ASIACRYPT 1994 - 4th International Conference on the Theory and Applications of Cryptology, Proceedings
Place of PublicationBerlin; Heidelberg
PublisherSpringer, Springer Nature
Pages322-330
Number of pages9
Volume917
ISBN (Electronic)9783540492368
ISBN (Print)9783540593393
DOIs
Publication statusPublished - 1995
Externally publishedYes
Event4th International Conference on the Theory and Applications of Cryptology, ASIACRYPT 1994 - Wollongong, Australia
Duration: 28 Nov 19941 Dec 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume917
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Conference on the Theory and Applications of Cryptology, ASIACRYPT 1994
CountryAustralia
CityWollongong
Period28/11/941/12/94

Fingerprint

Dive into the research topics of 'Attacking the SL<sub>2</sub> hashing scheme'. Together they form a unique fingerprint.

Cite this