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.

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

In English

Författare

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.

Publiceringsår

1996

Språk

Engelska

Sidor

31-44

Publikation/Tidskrift/Serie

Advances in Cryptology / Lecture Notes in Computer Science

Volym

1109

Dokumenttyp

Konferensbidrag

Förlag

Springer

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

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

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