The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
The MD4 Message Digest Algorithm
Open accessAbstract
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A Design Principle for Hash Functions
Damgård, I. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_39 · Cited by 1,188
Universal one-way hash functions and their cryptographic applications
Naor, M., & Yung, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73011 · Cited by 959
One Way Hash Functions and DES
Merkle, R. C. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_40 · Cited by 872
Pseudo-random generation from one-way functions
Impagliazzo, R., Levin, L. A., & Luby, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73009 · Cited by 724
One-way functions are necessary and sufficient for secure signatures
Rompel, J. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100269 · Cited by 695
Schneier, B. (2015) · Wiley eBooks · doi:10.1002/9781119183471.ch18 · Cited by 236
A user authentication scheme not requiring secrecy in the computer
Evans, A., Kantrowitz, W., & Weiss, E. (1974) · Communications of the ACM · doi:10.1145/361082.361087 · Cited by 174
Harrison, M. C., & Wilkes, M. V. (1970) · Mathematics of Computation · doi:10.2307/2004522 · Cited by 158
Research works printed but not linked: 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.
- Donald E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, 1969. Second edition, 1981.
Cited by
How to Break MD5 and Other Hash Functions
Wang, X., & Yu, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_2 · Cited by 1,440
How to time-stamp a digital document
Haber, S., & Stornetta, W. S. (1991) · Journal of Cryptology · doi:10.1007/bf00196791 · Cited by 1,483
Pricing via processing or combatting junk mail
Dwork, C., & Naor, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48071-4_10 · Cited by 1,282
Multimedia data-embedding and watermarking technologies
Swanson, M. D., Kobayashi, M., & Tewfik, A. H. (1998) · Proceedings of the IEEE · doi:10.1109/5.687830 · Cited by 924
Authentication in distributed systems: theory and practice
Lampson, B., Abadi, M., Burrows, M., & Wobber, E. (1992) · ACM Transactions on Computer Systems · doi:10.1145/138873.138874 · Cited by 607
Prudent engineering practice for cryptographic protocols
Abadi, M., & Needham, R. (1996) · IEEE Transactions on Software Engineering · doi:10.1109/32.481513 · Cited by 574
The S/KEY One-Time Password System
Haller, N. (1995) · doi:10.17487/rfc1760 · Cited by 537
Authentication in distributed systems: a bibliography
Liebl, A. (1993) · ACM SIGOPS Operating Systems Review · doi:10.1145/163640.163643 · Cited by 534
RIPEMD-160: A strengthened version of RIPEMD
Dobbertin, H., Bosselaers, A., & Preneel, B. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60865-6_44 · Cited by 487
Robust audio watermarking using perceptual masking
Swanson, M. D., Zhu, B., Tewfik, A. H., & Boney, L. (1998) · Signal Processing · doi:10.1016/s0165-1684(98)00014-0 · Cited by 449
How to Time-Stamp a Digital Document
Haber, S., & Stornetta, W. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-38424-3_32 · Cited by 404
Improving the Efficiency and Reliability of Digital Time-Stamping
Bayer, D., Haber, S., & Stornetta, W. S. (1993) · Sequences II · doi:10.1007/978-1-4613-9323-8_24 · Cited by 391
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
Joux, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_19 · Cited by 379
Security Analysis of SHA-256 and Sisters
Gilbert, H., & Handschuh, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24654-1_13 · Cited by 347
The First Collision for Full SHA-1
Stevens, M., Bursztein, E., Karpman, P., Albertini, A., & Markov, Y. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-63688-7_19 · Cited by 335
A fast new DES implementation in software
Biham, E. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052352 · Cited by 328
On-line/off-line digital signatures
Even, S., Goldreich, O., & Micali, S. (1996) · Journal of Cryptology · doi:10.1007/bf02254791 · Cited by 318
Secure agreement protocols: reliable and atomic group multicast in rampart
Reiter, M. K. (1994) · Proceedings of the 2nd ACM Conference on Computer and communications security - CCS '94 · doi:10.1145/191177.191194 · Cited by 289
Collisions for the compression function of MD5
den Boer, B., & Bosselaers, A. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_26 · Cited by 273
Differential collisions in SHA-0
Chabaud, F., & Joux, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055720 · Cited by 209
Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
Aoki, K., & Sasaki, Y. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_5 · Cited by 115
BF2: A Bloom-Filtered Brute-Force Framework for Multi-Target Password Recovery
Aslan, C., Pünter, W., & Dörr, C. (2026) · IACR Communications in Cryptology · doi:10.62056/a6hee0fgx
Metadata
- Authors
- Rivest, R. L.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-12-03
- Pages
- 303-311
- OpenAlex
- W2098801947
- Cited by
- 486
- References
- 9
- 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
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.