Abstract
The MD4 message digest algorithm takes an input message of arbitrary length and produces an output 128-bit “fingerprint” or “message digest”, in such a way that it is (hopefully) computationally infeasible to produce two messages having the same message digest, or to produce any message having a given prespecified target message digest. The MD4 algorithm is thus ideal for digital signature applications: a large file can be securely “compressed” with MD4 before being signed with (say) the RSA public-key cryptosystem.
The MD4 algorithm is designed to be quite fast on 32-bit machines. For example, on a SUN Sparc station, MD4 runs at 1,450,000 bytes/second (11.6 Mbit/sec). In addition, the MD4 algorithm does not require any large substitution tables; the algorithm can be coded quite compactly.
The MD4 algorithm is being placed in the public domain for review and possible adoption as a standard.
Supported by RSA Data Security (Redwood City, California, 94065).
Chapter PDF
Similar content being viewed by others
Keywords
- Hash Function
- User Authentication Scheme
- Digital Signature Scheme
- Secure Digital Signature
- Secure Digital Signature Scheme
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ivan Bjerre Damgård. A design principle for hash functions. In G. Brassard, editor, Proceedings CRYPTO 89, pages 416–427. Springer, 1990. Lecture Notes in Computer Science No. 435.
D. W. Davies and W. L. Price. The application of digital signatures based on public-key cryptosystems. In Proc. Fifth Intl. Computer Communications Conference, pages 525–530, October 1980.
W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory, IT-22:644–654, November 1976.
A. Evans, W. Kantrowitz, and E. Weiss. A user authentication scheme not requiring secrecy in the computer. CACM, 17:437–442, August 1974.
Russell Impagliazzo, Leonid A. Levin, and Michael Luby. Pseudo-random generation from one-way functions. In Proc. 21th ACM Symposium on Theory of Computing, pages 12–24, Seattle, 1989. ACM.
Donald E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, 1969. Second edition, 1981.
Ralph C. Merkle. One way hash functions and DES. In G. Brassard, editor, Proceedings CRYPTO 89, pages 428–446. Springer, 1990. Lecture Notes in Computer Science No. 435.
M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In Proc. 21th ACM Symposium on Theory of Computing, pages 33–43, Seattle, 1989. ACM.
John Rompel. One-way functions are necessary and sufficient for secure signatures. In Proc. 22nd ACM Symposium on Theory of Computing, pages 387–394, Baltimore, Maryland, 1990. ACM.
M. V. Wilkes. Time-sharing computer systems. Elsevier, 1975. Third edition.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rivest, R.L. (1991). The MD4 Message Digest Algorithm. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_22
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive