On the security of the hashing scheme based on SL2

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

Tillich and Zémor proposed a hashing scheme based on the group of unimodular matrices SL2(Fq) over a finite field Fq of q = 2n elements. Charnes and Pieprzyk studied the security of this scheme. They showed that for n = 131 and for some irreducible polynomial P131(x) this scheme is weak. We show that with suffciently high probability the polynomials Pn(x) can be chosen in such a way that this type of attack can be avoided. Futhermore, we generalize the Tillich-Zémor hashing scheme for any finite field Fq and show that the new generalized scheme has similar properties.

Original languageEnglish
Title of host publicationFast Software Encryption - 5th International Workshop, FSE 1998, Proceedings
EditorsSerge Vaudenay
PublisherSpringer Verlag
Pages93-102
Number of pages10
ISBN (Print)354064265X, 9783540642657
DOIs
Publication statusPublished - 1998
Externally publishedYes
Event5th International Workshop on Fast Software Encryption, FSE 1998 - Paris, France
Duration: Mar 23 1998Mar 25 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1372
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th International Workshop on Fast Software Encryption, FSE 1998
Country/TerritoryFrance
CityParis
Period3/23/983/25/98

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'On the security of the hashing scheme based on SL2'. Together they form a unique fingerprint.

Cite this