Advanced

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

Helleseth, Tor and Johansson, Thomas LU (1996) 16th Annual International Cryptology Conference CRYPTO ’96 In Advances in Cryptology / Lecture Notes in Computer Science 1109. p.31-44
Abstract
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
exponential sums, Universal hash functions, authentication codes, Galois rings
in
Advances in Cryptology / Lecture Notes in Computer Science
volume
1109
pages
31 - 44
publisher
Springer
conference name
16th Annual International Cryptology Conference CRYPTO ’96
external identifiers
  • scopus:84955569997
ISSN
1611-3349
0302-9743
ISBN
978-3-540-61512-5
DOI
10.1007/3-540-68697-5_3
language
English
LU publication?
yes
id
963d5324-12f5-44fa-b574-778380da40ef (old id 1157332)
date added to LUP
2008-06-09 13:44:16
date last changed
2017-06-11 03:55:34
@inproceedings{963d5324-12f5-44fa-b574-778380da40ef,
  abstract     = {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.},
  author       = {Helleseth, Tor and Johansson, Thomas},
  booktitle    = {Advances in Cryptology / Lecture Notes in Computer Science},
  isbn         = {978-3-540-61512-5},
  issn         = {1611-3349},
  keyword      = {exponential sums,Universal hash functions,authentication codes,Galois rings},
  language     = {eng},
  pages        = {31--44},
  publisher    = {Springer},
  title        = {Universal hash functions from exponential sums over finite fields and Galois rings},
  url          = {http://dx.doi.org/10.1007/3-540-68697-5_3},
  volume       = {1109},
  year         = {1996},
}