Abstract
With the advent of the Pentium processor parallelization finally became available to Intel based computer systems. One of the design principles of the MD4-family of hash functions (MD4, MD5, SHA-1, RIPEMD-160) is to be fast on the 32-bit Intel processors. This paper shows that carefully coded implementations of these hash functions are able to exploit the Pentium’s superscalar architecture to its maximum effect: the performance with respect to execution on a non-parallel architecture increases by about 60%. This is an important result in view of the recent claims on the limited data bandwidth of these hash functions. Moreover, it is conjectured that these implementations are very close to optimal. It will also be shown that the performance penalty incurred by non-cached data and endianness conversion is limited, and in the order of 10% of running time.
Chapter PDF
Similar content being viewed by others
References
M. Abrash, Zen of code optimization, Coriolis Group Books, 1994.
H. Dobbertin, “Cryptanalysis of MD4,” Fast Software Encryption, LNCS 1039, D. Gollmann, Ed., Springer-Verlag, 1996, pp. 53–69.
H. Dobbertin, “Cryptanalysis of MD5 compress,” presented at the rump session of Eurocrypt’96.
H. Dobbertin, A. Bosselaers, B. Preneel, “RIPEMD-160: A Strengthened Version of RIPEMD,” Fast Software Encryption, LNCS 1039, D. Gollmann, Ed., Springer-Verlag, 1996, pp. 71–82. A corrected version and a C reference implementation can be found in the directory /pub/COSIC/bosselae/ripemd/at ftp site ftp://esat.kuleuven.ac.be.
[FIPS180-1] FIPS 180-1, Secure hash standard, NIST, US Department of Commerce, Washington, D.C., April 1995.
P. Gulutzan, “Making programs go faster,” Dr. Dobb’s Journal, Vol. 20, No. 1, January 1995, pp. 133–135.
Pentium processor user’s manual, Volume 1: Pentium processor’s data book, Intel Corp., Mt. Prospect, Ill., 1993.
Pentium processor user’s manual, Volume 3: Architecture and programming manual, Intel Corp., Mt. Prospect, Ill., 1993.
T. Mathisen, “Pentium Secrets,” Byte, Vol. 19, No. 7, July 1994, pp. 191–192.
D. Naccache, D. M’Raïhi, S. Vaudenay, D. Raphaeli, “Can DSA be improved? Complexity trade-offs with the Digital Signature Standard,” Advances in Cryptology, Proceedings Eurocrypt’94, LNCS 950, A. De Santis, Ed., Springer-Verlag, 1995, pp. 77–85.
B. Preneel, Analysis and design of cryptographic hash functions, Ph.D. thesis, K.U.Leuven, February 1993.
B. Preneel, “Cryptographic hash functions,” European Transactions on Telecommunications, Vol. 5, No. 4, 1994, pp. 431–448.
R.L. Rivest, “The MD4 message-digest algorithm,” Request for Comments (RFC) 1320, Internet Activities Board, Internet Privacy Task Force, April 1992.
R.L. Rivest, “The MD5 message-digest algorithm,” Request for Comments (RFC) 1321, Internet Activities Board, Internet Privacy Task Force, April 1992.
M. Robshaw, “MD2, MD4, MD5, SHA, and other hash functions,” Technical Report TR-101, Version 4.0, RSA Laboratories, July 1995.
P. Rogaway and D. Coppersmith, “A software-optimized encryption algorithm,” Fast Software Encryption, LNCS 809, R. Anderson, Ed., Springer-Verlag, 1994, pp. 56–63.
RIPE, Integrity Primitives for Secure Information Systems. Final Report of RACE Integrity Primitives Evaluation (RIPE-RACE 1040), LNCS 1007, A. Bosselaers and B. Prencel, Eds., Springer-Verlag, 1995.
J. Touch, “Performance analysis of MD5,” Proceedings of ACM SIGCOMM’95, Comp. Comm. Review, Vol. 25, No. 4, 1995, pp. 77–86.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bosselaers, A., Govaerts, R., Vandewalle, J. (1996). Fast Hashing on the Pentium. In: Koblitz, N. (eds) Advances in Cryptology — CRYPTO ’96. CRYPTO 1996. Lecture Notes in Computer Science, vol 1109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68697-5_23
Download citation
DOI: https://doi.org/10.1007/3-540-68697-5_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61512-5
Online ISBN: 978-3-540-68697-2
eBook Packages: Springer Book Archive