Bucket hashing with a small key size'

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingResearchpeer-review

16 Citations (SciVal)

Abstract

In this paper we consider very fast evaluation of strongly universal hash functions, or equivalently, authentication codes. We show how it is possible to modify some known families of hash functions into a form such that the evaluation is similar to “bucket hashing”, a technique for very fast hashing introduced by Rogaway. Rogaway’s bucket hash family has a huge key size, which for common parameter choices can be more than a hundred thousand bits. The proposed hash families have a key size that is close to the key size of the theoretically best known constructions, typically a few hundred bits, and the evaluation has a time complexity that is similar to bucket hashing.
Original languageEnglish
Title of host publicationAdvances in Cryptology / Lecture Notes in Computer Science
PublisherSpringer
Pages149-162
Volume1233
ISBN (Print)978-3-540-62975-7
DOIs
Publication statusPublished - 1997
Eventnternational Conference on the Theory and Application of Cryptographic Techniques EUROCRYPT ’97 - Konstanz, Germany
Duration: 1997 May 111997 May 15

Publication series

Name
Volume1233
ISSN (Print)1611-3349
ISSN (Electronic)0302-9743

Conference

Conferencenternational Conference on the Theory and Application of Cryptographic Techniques EUROCRYPT ’97
Country/TerritoryGermany
CityKonstanz
Period1997/05/111997/05/15

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • bucket hashing
  • authentication codes
  • Universal hash functions
  • message authentication
  • software implementations

Fingerprint

Dive into the research topics of 'Bucket hashing with a small key size''. Together they form a unique fingerprint.

Cite this