Square Hash with a Small Key Size

摘要

This paper shows an improvement of square hash function family proposed by Etzel et al.. 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.