The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Finding Collisions in the Full SHA-1
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
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
Self-citation(2005) · Lecture notes in computer science · doi:10.1007/b136415 · Cited by 1,234
(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
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-citationCryptanalysis of the Hash Functions MD4 and RIPEMD
Wang, X., Lai, X., Feng, D., Chen, H., & Yu, X. (2005) · Lecture notes in computer science · doi:10.1007/11426639_1 · Cited by 445
Self-citationEfficient Collision Search Attacks on SHA-0
Wang, X., Yu, H., & Yin, Y. L. (2005) · Lecture notes in computer science · doi:10.1007/11535218_1 · Cited by 412
Self-citationBiham, 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
Collisions of SHA-0 and Reduced SHA-1
Biham, E., Chen, R., Joux, A., Carribault, P., Lemuet, C., & Jalby, W. (2005) · Lecture notes in computer science · doi:10.1007/11426639_3 · Cited by 142
Cited by
Charm: 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
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
Pioneer: verifying code integrity and enforcing untampered code execution on legacy systems
Seshadri, A., Luk, M., Shi, E., Perrig, A., van Doorn, L., & Khosla, P. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095812 · Cited by 314
Rebound Distinguishers: Results on the Full Whirlpool Compression Function
Lamberger, M., Mendel, F., Rechberger, C., Rijmen, V., & Schläffer, M. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_8 · Cited by 159
Guo, J., Ling, S., Rechberger, C., & Wang, H. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17373-8_4 · Cited by 127
An Overview of Perceptual Hashing
Farid, H. (2021) · Journal of Online Trust and Safety · doi:10.54501/jots.v1i1.24 · Cited by 70
(2005) · doi:10.5555/1251028.1251039 · Cited by 67
Keyed Hash Function Using Hyper Chaotic System with Time-Varying Parameters Perturbation
Liu, H., Kadir, A., & Liu, J. (2019) · IEEE Access · doi:10.1109/access.2019.2896661 · Cited by 47
Comparison of Hash Function Algorithms Against Attacks: A Review
Maetouq, A., Mohd, S., Azurati, N., Maarop, N., Nur, N., & Abas, H. (2018) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2018.090813 · Cited by 37
Guo, H., Li, W., Meese, C., Wang, Y., & Nejad, M. (2025) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2025.3619069
Metadata
- Authors
- Wang, X., Yin, Y. L., & Yu, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 17-36
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1656731780
- Cited by
- 1,418
- References
- 13
- FWCI
- 87.77
- 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.