Square hash with a small key size

Authors:
Swee-Huay Heng;Kaoru Kurosawa
Affiliations:
Tokyo Institute of Technology, Tokyo, Japan;Ibaraki University, Hitachi, Ibaraki, Japan
Venue:
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Year:
2003

Citing 10
Cited 1

Universal hashing and authentication codes

Designs, Codes and Cryptography
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Fast Universal Hashing with Small Keys and No Preprocessing: The PolyR Construction

ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
The Security of Cipher Block Chaining

CRYPTO '94 Proceedings of the 14th 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
MMH: Software Message Authentication in the Gbit/Second Rates

FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Fast Message Authentication Using Efficient Polynomial Evaluation

FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
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

New constructions of universal hash functions based on function sums

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper shows an improvement of square hash function family proposed by Etzel et al. [5]. In the new variants, the size of keys is much shorter while the collision probability is slightly larger. Most of the main techniques used to optimize the original square hash functions work on our variants as well. The proposed algorithms are applicable to fast and secure message authentication.