@inproceedings{963d532412f544fab574778380da40ef,
title = "Universal hash functions from exponential sums over finite fields and Galois rings",
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.",
keywords = "exponential sums, Universal hash functions, authentication codes, Galois rings",
author = "Tor Helleseth and Thomas Johansson",
year = "1996",
doi = "10.1007/3-540-68697-5_3",
language = "English",
isbn = "978-3-540-61512-5",
volume = "1109",
publisher = "Springer",
pages = "31--44",
booktitle = "Advances in Cryptology / Lecture Notes in Computer Science",
address = "Germany",
note = "16th Annual International Cryptology Conference CRYPTO {\textquoteright}96 ; Conference date: 12-08-1996 Through 18-08-1996",
}