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.

Universal hash functions from exponential sums over finite fields and Galois rings

På svenska

Author

Summary, in English

In this paper new families of strongly universal hash functions, or equivalently, authentication codes, are proposed. Their parameters are derived from bounds on exponential sums over finite fields and Galois rings. This is the first time hash families based upon such exponential sums have been considered. Their performance improves the previously best known constructions and they can be made general in their choice of parameters. Furthermore, the constructions are suitable both for hardware and software implementations. The latter is an aspect that is significant and has been considered in several recent papers.

Publishing year

1996

Language

English

Pages

31-44

Publication/Series

Advances in Cryptology / Lecture Notes in Computer Science

Volume

1109

Document type

Conference paper

Publisher

Springer

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • exponential sums
  • Universal hash functions
  • authentication codes
  • Galois rings

Conference name

16th Annual International Cryptology Conference CRYPTO ’96

Conference date

1996-08-12 - 1996-08-18

Status

Published

ISBN/ISSN/Other

  • ISSN: 0302-9743
  • ISSN: 1611-3349
  • ISBN: 978-3-540-61512-5