New universal hash functions

Authors:
Aysajan Abidin;Jan-Åke Larsson
Affiliations:
Department of Electrical Engineering, Linköping University, Linköping, Sweden;Department of Electrical Engineering, Linköping University, Linköping, Sweden
Venue:
WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
Year:
2011

Citing 14
Cited 0

The computational complexity of universal hashing

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Combinatorial techniques for universal hashing

Journal of Computer and System Sciences
On families of hash functions via geometric codes and concatenation

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Codes for interactive authentication

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
UMAC: Fast and Secure Message Authentication

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Universal Hashing and Authentication Codes

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
LFSR-based Hashing and Authentication

CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Bucket Hashing and its Application to Fast Message Authentication

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Universal Hashing and Multiple Authentication

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
MMH: Software Message Authentication in the Gbit/Second Rates

FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Message authentication codes

Message authentication codes
Bucket hashing with a small key size

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
New hash functions for message authentication

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
On the cardinality of systematic authentication codes via error-correcting codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 Universal2 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.