Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Bucket hashing with a small key size'

In English

Författare

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.

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

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • 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/Övrigt

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