Abstract
This paper introduces two new ideas in the construction of fast universal hash functions geared towards the task of message authentication. First, we describe a simple but novel family of universal hash functions that is more efficient than many standard constructions. We compare our hash functions to the MMH family studied by Halevi and Krawczyk [12]. All the main techniques used to optimize MMH work on our hash functions as well. Second, we introduce additional techniques for speeding up our constructions; these techniques apply to MMH and may apply to other hash functions. The techniques involve ignoring certain parts of the computation, while still retaining the necessary statistical properties for secure message authentication. Finally, we give implementation results on an ARM processor. Our constructions are general and can be used in any setting where universal hash functions are needed; therefore they may be of independent interest.
Extended abstract. A full version is available at http://theory.lcs.mit.edu/~zulfikar
Work done while this author was at Lucent Technologies. This author would like to acknowledge DARPA grant DABT63-96-C-0018 and an NSF graduate fellowship.
Chapter PDF
Similar content being viewed by others
References
M. Atici and D. Stinson. Universal hashing and multiple authentication. In Proc. CRYPTO 96, Lecture Notes in Computer Science. Springer-Verlag, 1996.
M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Proc. CRYPTO 96, Lecture Notes in Computer Science. Springer-Verlag, 1996.
M. Bellare, J. Killian, and P. Rogaway. The security of cipher block chaining. In Proc. CRYPTO 94, Lecture Notes in Computer Science. Springer-Verlag, 1994.
A. Bosselaers, R. Govaerts, and J. Vandewalle. Fast hashing on the Pentium. In Proc. CRYPTO 96, Lecture Notes in Computer Science. Springer-Verlag, 1996.
G. Brassard. On computationally secure authentication tags requiring short secret shared keys. In Proc. CRYPTO 82, Lecture Notes in Computer Science, pages 79–86, 1982.
L. Carter and M. Wegman. Universal hash functions. Journal of Computer and System Sciences, 18:143–144, 1979.
S. P. Dandamudi. Introduction to Assembly Language Programming From 8086 to Pentium Proecessors. Springer-Verlag New York, 1998.
E. Gilbert, F.M. Williams, and N. Sloane. Codes which detect deception. Bell System Technical Journal, 53(3):405–424, 1974.
O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):210–217, 1986.
O. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. Siam Journal of Computing, 17(2):281–308, 1988.
S. Halevi and H. Krawczyk. MMH: Message authentication in software in the gbit/second rates. In Proceedings of the 4th Workshop on Fast Software Encryption, Lecture Notes in Computer Science. Springer-Verlag, 1997.
T. Helleseth and T. Johansson. Universal hash functions from exponential sums over finite fields. In Proc. CRYPTO 96, Lecture Notes in Computer Science. Springer-Verlag, 1996.
T. Johansson. Bucket hashing with small key size. In Proc. EUROCRYPT 97, Lecture Notes in Computer Science. Springer-Verlag, 1997.
L. Knudsen. Truncated and higher order differentials. In Proceedings of the 2nd Workshop on Fast Software Encryption, Lecture Notes in Computer Science. Springer-Verlag, 1995.
H. Krawczyk. LFSR-based hashing and authentication. In Proc. CRYPTO 94, Lecture Notes in Computer Science. Springer-Verlag, 1994.
H. Krawczyk. New hash functions for message authentication. In Proc. EURO-CRYPT 95, Lecture Notes in Computer Science. Springer-Verlag, 1995.
A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
M. Naor and O. Reingold. On the construction of pseudo-random permutations: Luby-rackoff revisited. Journal of Cryptology, 1999. To Appear. Extended abstract in: Proc. 29th Ann. ACM Symp. on Theory of Computing, 1997, pp. 189–199.
W. Nevelsteen and B. Preneel. Software performance of universal hash functions. In Proc. EUROCRYPT 99, Lecture Notes in Computer Science. Springer-Verlag, 1999.
National Bureau of Standards. FIPS publication 46: Data encryption standard, 1977. Federal Information Processing Standards Publication 46.
S. Patel, Z.A. Ramzan, and G. Sundaram. Towards making Luby-Rackoff ciphers practical and optimal. In Proceedings of Sixth Workshop on Fast Software Encryption, March 1999. To Appear.
B. Preneel and P.C. van Oorschot. On the security of two MAC algorithms. In Proc. EUROCRYPT 96, Lecture Notes in Computer Science. Springer-Verlag, 1996.
R. Rivest. The MD5 message digest algorithm. IETF RFC-1321, 1992.
P. Rogaway. Bucket hashing and its application to fast message authentication. In Proc. CRYPTO 95, Lecture Notes in Computer Science. Springer-Verlag, 1995.
V. Shoup. On fast and provably secure message authentication based on universal hashing. In Proc. CRYPTO 96, Lecture Notes in Computer Science. Springer-Verlag, 1996.
D. Stinson. Universal hashing and authentication codes. Designs, Codes, and Cryptography, 4:369–380, 1994.
M. Wegman and L. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, 22:265–279, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Etzel, M., Patel, S., Ramzan, Z. (1999). Square Hash: Fast Message Authentication via Optimized Universal Hash Functions. In: Wiener, M. (eds) Advances in Cryptology — CRYPTO’ 99. CRYPTO 1999. Lecture Notes in Computer Science, vol 1666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48405-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-48405-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66347-8
Online ISBN: 978-3-540-48405-9
eBook Packages: Springer Book Archive