Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Bucket hashing with a small key size'

Publiceringsår: 1997
Språk: Engelska
Sidor: 149-162
Publikation/Tidskrift/Serie: Advances in Cryptology / Lecture Notes in Computer Science
Volym: 1233
Dokumenttyp: Konferensbidrag
Förlag: Springer


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.


  • Electrical Engineering, Electronic Engineering, Information Engineering
  • bucket hashing
  • authentication codes
  • Universal hash functions
  • message authentication
  • software implementations


Nternational Conference on the Theory and Application of Cryptographic Techniques EUROCRYPT ’97
  • ISSN: 0302-9743
  • ISSN: 1611-3349
  • ISBN: 978-3-540-62975-7

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen