Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 486

The DOI matches its Crossref record.

The MD4 Message Digest Algorithm

Open access
Rivest, Ronald L.·2007·Lecture Notes in Computer Science
DOI 10.1007/3-540-38424-3_22
Open this paper in CoChat — free account

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/3-540-38424-3_22

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 10

  1. 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. · DOI · Paper page
  2. 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.
  3. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory, IT-22:644–654, November 1976. · DOI · Paper page
  4. A. Evans, W. Kantrowitz, and E. Weiss. A user authentication scheme not requiring secrecy in the computer. CACM, 17:437–442, August 1974. · DOI · Paper page
  5. 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. · DOI · Paper page
  6. Donald E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, 1969. Second edition, 1981.
  7. 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. · DOI · Paper page
  8. 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. · DOI · Paper page
  9. 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. · DOI · Paper page
  10. M. V. Wilkes. Time-sharing computer systems. Elsevier, 1975. Third edition.

Cited by

See all 486

Metadata

Authors
Rivest, R. L.
Venue
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Published
2007-12-03
Pages
303-311
DOI
10.1007/3-540-38424-3_22
OpenAlex
W2098801947
Cited by
486
References
0
FWCI
23.64
Type
conference paper
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The MD4 Message Digest Algorithm. https://app.cochat.ai/papers/10.1007/3-540-38424-3_22
The paper
Rivest, R. L. (2007). The MD4 Message Digest Algorithm. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-38424-3_22

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.