The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Bucket hashing with a small key size'

På svenska

Author

Summary, in English

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.

Publishing year

1997

Language

English

Pages

149-162

Publication/Series

Advances in Cryptology / Lecture Notes in Computer Science

Volume

1233

Document type

Conference paper

Publisher

Springer

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

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

Conference name

nternational Conference on the Theory and Application of Cryptographic Techniques EUROCRYPT ’97

Conference date

1997-05-11 - 1997-05-15

Conference place

Konstanz, Germany

Status

Published

ISBN/ISSN/Other

  • ISSN: 1611-3349
  • ISSN: 0302-9743
  • ISBN: 978-3-540-62975-7