Abstract
We describe a universal hash-function family, PolyR, which hashes messages of effectively arbitrary lengths in 3.9-6.9 cycles/byte (cpb) on a Pentium II (achieving a collision probability in the range 2-16-2-50). Unlike most proposals, PolyR actually hashes short messages faster (per byte) than long ones. At the same time, its key is only a few bytes, the output is only a few bytes, and no “preprocessing” is needed to achieve maximal efficiency. Our designs have been strongly influenced by low-level considerations relevant to software speed, and experimental results are given throughout.
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
Afanassie, V., Gehrmann, C., AND Smeets, B. Fast message authentication using efficient polynomial evaluation. In Proceedings of the 4th Workshop on Fast Software Encryption (1997), vol. 1267, Springer-Verlag, pp. 190–204.
Bernstein, D. Floating-point arithmetic and message authentication. Unpublished manuscript, http://cr.yp.to/papers.html, 2000.
Black, J., Halevi, S., Krawczyk, H., Krovetz, T., AND Rogaway, P. UMAC: Fast and secure message authentication. In Advances in Cryptology-CRYPTO’ 99 (1999), vol. 1666 of Lecture Notes in Computer Science, Springer-Verlag, pp. 216–233.
Black, J., Halevi, S., Krawczyk, H., Krovetz, T., AND Rogaway, P. UMAC: Fast and secure message authentication. In Advances in Cryptology-CRYPTO’ 99 (1999), vol. 1666 of Lecture Notes in Computer Science, Springer-Verlag, pp. 216–233.
Bosselaers, A., Govaerts, R., AND Vandewalle, J. Fast hashing on the Pentium. In Advances in Cryptology-CRYPTO’ 96 (1996), vol. 1109 of Lecture Notes in Computer Science, Springer-Verlag, pp. 298–312. Updated timing at http://www.esat.kuleuven.ac.be/ bosselae/fast.html.
Carter, L., AND Wegman, M. Universal classes of hash functions. J. of Computer and System Sciences 18 (1979), 143–154.
Halevi, S., AND Krawczyk, H. MMH: Software message authentication in the Gbit/second rates. In Proceedings of the 4th Workshop on Fast Software Encryption (1997), vol. 1267, Springer-Verlag, pp. 172–189.
Krawvzyk, H. LFSR-based hashing and authentication. In Advances in Cryptology-CRYPTO’ 94 (1994), vol. 839 of Lecture Notes in Computer Science, Springer-Verlag, pp. 129–139.
Rogaway, P. Bucket hashing and its application to fast message authentication. In Advances in Cryptology-CRYPTO’ 95 (1995), vol. 963 of Lecture Notes in Computer Science, Springer-Verlag, pp. 313–328.
Shoup, V. On fast and provably secure message authentication based on universal hashing. In Advances in Cryptology-CRYPTO’ 96 (1996), vol. 1109 of Lecture Notes in Computer Science, Springer-Verlag, pp. 313–328.
Tsudik, G. Message authentication with one-way hash functions. Computer Communications Review 22 (1992), 29–38.
Wegman, M., AND Carter, L. New hash functions and their use in authentication and set equality. J. of Computer and System Sciences 22 (1981), 265–279.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krovetz, T., Rogaway, P. (2001). Fast Universal Hashing with Small Keys and No Preprocessing: The PolyR Construction. In: Won, D. (eds) Information Security and Cryptology — ICISC 2000. ICISC 2000. Lecture Notes in Computer Science, vol 2015. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45247-8_7
Download citation
DOI: https://doi.org/10.1007/3-540-45247-8_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41782-8
Online ISBN: 978-3-540-45247-8
eBook Packages: Springer Book Archive