The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
How to Break MD5 and Other Hash Functions
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.
Integrity signals
Registry
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.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1 · Cited by 2,619
The MD5 Message-Digest Algorithm
Rivest, R. (1992) · doi:10.17487/rfc1321 · Cited by 1,976
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45473-x · Cited by 1,422
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
Differential Cryptanalysis of the Data Encryption Standard
Biham, E., & Shamir, A. (1993) · Springer eBooks · doi:10.1007/978-1-4613-9314-6 · Cited by 1,054
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
(2004) · Lecture notes in computer science · doi:10.1007/b99099 · Cited by 709
(2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-48000-7 · Cited by 661
(2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-78372-7 · Cited by 620
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
The MD4 Message Digest Algorithm
Rivest, R. L. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-38424-3_22 · Cited by 486
Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMDPreprint
Wang, X., Feng, D., Lai, X., & Yu, H. (2004) · IACR Cryptology ePrint Archive · Cited by 455
Self-citationCollisions 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
Biham, E., & Chen, R. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_18 · Cited by 226
Differential collisions in SHA-0
Chabaud, F., & Joux, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055720 · Cited by 209
Advances in Cryptology — AUSCRYPT '92
(1993) · Lecture notes in computer science · doi:10.1007/3-540-57220-1 · Cited by 195
Dobbertin, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60865-6_43 · Cited by 183
HAVAL - A One-Way Hashing Algorithm with Variable Length of Output
Yuliang Zheng, A., Pieprzyk, J., & Seberry, J. (1992) · Research Online (University of Wollongong) · Cited by 135
Bosselaers, A., & Preneel, B. (1995) · Cited by 71
Bosselaers, A., & Preneel, B. (1995) · Cited by 36
Cited by
Finding Collisions in the Full SHA-1
Wang, X., Yin, Y. L., & Yu, H. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_2 · Cited by 1,418
Self-citationCharm: a framework for rapidly prototyping cryptosystems
Akinyele, J. A., Garman, C., Miers, I., Pagano, M. W., Rushanan, M., Green, M., & Rubin, A. D. (2013) · Journal of Cryptographic Engineering · doi:10.1007/s13389-013-0057-3 · Cited by 675
Cybersecurity in an Era with Quantum Computers: Will We Be Ready?
Mosca, M. (2018) · IEEE Security & Privacy · doi:10.1109/msp.2018.3761723 · Cited by 581
The PHOTON Family of Lightweight Hash Functions
Guo, J., Peyrin, T., & Poschmann, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_13 · Cited by 558
Biclique Cryptanalysis of the Full AES
Bogdanov, A., Khovratovich, D., & Rechberger, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_19 · Cited by 546
Metadata
- Authors
- Wang, X., & Yu, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 19-35
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2103239853
- Cited by
- 1,440
- References
- 22
- FWCI
- 78.23
- Type
- conference paper
- Language
- en
- Open access
- closed
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.