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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
V. Afanassiev, C. Gehrmann and B. Smeets, “Fast message authentication using efficient polynomial evaluation,” Fast Software Encryption, FSE’ 97, LNCS 1267, pp. 190–204, Springer Verlag, 1997.
J. Black, S. Halevi, H. Krawczyk, T. Krovetz and P. Rogaway, “UMAC: Fast and secure message authentication,” Advances in Cryptology — CRYPTO’ 99, LNCS 1666, pp. 216–233, Springer-Verlag, 1999.
M. Bellare, J. Killian and P. Rogaway, “The security of cipher block chaining,” Advances in Cryptology—CRYPTO’ 94, LNCS 839, pp. 341–358, Springer-Verlag, 1994.
J. L. Carter and M. N. Wegman, “Universal classes of hash functions,” Journal of Computer and System Sciences, vol. 18, no. 2, pp. 143–154, 1979.
M. Etzel, S. Patel and Z. Ramzan, “Square Hash: Fast message authentication via optimized universal hash functions,” Advances in Cryptology — CRYPTO’ 99, LNCS 1666, pp. 234–251, Springer-Verlag, 1999.
S. Halevi and H. Krawczyk, “MMH: Message authentication in software in the gbit/second rates,” Fast Software Encryption, FSE’ 97, LNCS 1267, pp. 172–189, Springer Verlag, 1997.
T. Johansson, “Bucket hashing with smaller key size,” Advances in Cryptology — EUROCRYPT’ 97, LNCS 1233, pp. 149–162, Springer-Verlag, 1997.
H. Krawczyk, “LFSR-based hashing and authentication,” Advances in Cryptology — CRYPTO’ 94, LNCS 839, pp. 129–139, Springer-Verlag, 1994.
H. Krawczyk, “New hash functions for message authentication,” Advances in Cryptology — EUROCRYPT’ 95, LNCS 921, pp. 301–310, Springer-Verlag, 1995.
T. Krovetz and P. Rogaway, “Fash universal hashing with small keys and no prepocessing: the polyR construction,” International Conference on Information Security and Cryptology — ICISC’ 00, LNCS 2015, pp. 73–89, Springer Verlag, 2001.
A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997.
P. Rogaway, “Bucket hashing and its application to fast message authentication,” Advances in Cryptology — CRYPTO’ 95, LNCS 963, pp. 15–25, Springer-Verlag, 1995.
V. Shoup, “On fast and provably secure message authentication based on universal hashing,” Advances in Cryptology — CRYPTO’ 96, LNCS 1109, pp. 313–328, Springer-Verlag, 1996.
D. R. Stinson, “Universal hashing and authentication codes,” Designs, Codes and Cryptography, vol. 4, pp. 369–380, 1994.
M. N. Wegman and J. L. Carter, “New hash functions and their use in authentication and set equality,” Journal of Computer and System Sciences, vol. 22, no. 3, pp. 265–279, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heng, SH., Kurosawa, K. (2003). Square Hash with a Small Key Size. In: Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 2003. Lecture Notes in Computer Science, vol 2727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45067-X_45
Download citation
DOI: https://doi.org/10.1007/3-540-45067-X_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40515-3
Online ISBN: 978-3-540-45067-2
eBook Packages: Springer Book Archive