Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Bucket hashing with a small key size'

Johansson, Thomas LU orcid (1997) nternational Conference on the Theory and Application of Cryptographic Techniques EUROCRYPT ’97 1233. p.149-162
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
bucket hashing, authentication codes, Universal hash functions, message authentication, software implementations
host publication
Advances in Cryptology / Lecture Notes in Computer Science
volume
1233
pages
149 - 162
publisher
Springer
conference name
nternational Conference on the Theory and Application of Cryptographic Techniques EUROCRYPT ’97
conference location
Konstanz, Germany
conference dates
1997-05-11 - 1997-05-15
external identifiers
  • scopus:0012022912
ISSN
0302-9743
1611-3349
ISBN
978-3-540-62975-7
DOI
10.1007/3-540-69053-0_12
language
English
LU publication?
yes
id
b87b17cc-61d4-472d-8db9-31028a7230b5 (old id 1157339)
date added to LUP
2016-04-01 12:26:43
date last changed
2025-01-02 18:12:02
@inproceedings{b87b17cc-61d4-472d-8db9-31028a7230b5,
  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.}},
  author       = {{Johansson, Thomas}},
  booktitle    = {{Advances in Cryptology / Lecture Notes in Computer Science}},
  isbn         = {{978-3-540-62975-7}},
  issn         = {{0302-9743}},
  keywords     = {{bucket hashing; authentication codes; Universal hash functions; message authentication; software implementations}},
  language     = {{eng}},
  pages        = {{149--162}},
  publisher    = {{Springer}},
  title        = {{Bucket hashing with a small key size'}},
  url          = {{http://dx.doi.org/10.1007/3-540-69053-0_12}},
  doi          = {{10.1007/3-540-69053-0_12}},
  volume       = {{1233}},
  year         = {{1997}},
}