Collisions for the compression function of MD5
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
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
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
The MD5 Message-Digest Algorithm
Rivest, R. (1992) · doi:10.17487/rfc1321 · Cited by 1,976
Rivest, R. L. (1990) · doi:10.17487/rfc1186 · Cited by 607
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
Schneier, B. (2015) · Wiley eBooks · doi:10.1002/9781119183471.ch18 · Cited by 236
An Attack on the Last Two Rounds of MD4
den Boer, B., & Bosselaers, A. (1992) · Lecture notes in computer science · doi:10.1007/3-540-46766-1_14 · Cited by 117
Self-citationAn attack on the last two rounds of MD4
den Boer, B., & Bosselaers, A. (1992) · Lecture notes in computer science · Cited by 56
Self-citation
Cited by
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
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
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
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
Self-citationTowards realizing random oracles: Hash functions that hide all partial information
Canetti, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052255 · Cited by 365
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
Finding Preimages in Full MD5 Faster Than Exhaustive Search
Sasaki, Y., & Aoki, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_8 · Cited by 220
Differential collisions in SHA-0
Chabaud, F., & Joux, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0055720 · Cited by 209
Chaotic hash-based fingerprint biometric remote user authentication scheme on mobile devices
Khan, M. K., Zhang, J., & Wang, X. (2008) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2006.05.061 · Cited by 167
Security Smells in Ansible and Chef Scripts: A Replication Study
Rahman, A., Rahman, M. R., Parnin, C., & Williams, L. (2021) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3408897 · Cited by 80
Metadata
- Authors
- den Boer, B., & Bosselaers, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1994
- Pages
- 293-304
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2172433705
- Cited by
- 273
- References
- 7
- FWCI
- 4.58
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.