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

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

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


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.


  • Electrical Engineering, Electronic Engineering, Information Engineering
  • exponential sums
  • Universal hash functions
  • authentication codes
  • Galois rings


16th Annual International Cryptology Conference CRYPTO ’96
  • ISSN: 1611-3349
  • ISSN: 0302-9743
  • ISBN: 978-3-540-61512-5

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