Universal hash functions are important building blocks for unconditionally secure message authentication codes. In this paper, we present a new construction of a class of ε-Almost Strongly Universal 2 hash functions with much smaller description (or key) length than the Wegman-Carter construction. Unlike some other constructions, our new construction has a very short key length and a security parameter ε that is independent of the message length, which makes it suitable for authentication in practical applications such as Quantum Cryptography. © 2012 Springer-Verlag.
CITATION STYLE
Abidin, A., & Larsson, J. Å. (2012). New universal hash functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7242 LNCS, pp. 99–108). https://doi.org/10.1007/978-3-642-34159-5_7
Mendeley helps you to discover research relevant for your work.