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
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
Secure Hybrid Encryption from Weakened Key Encapsulation
Hofheinz, D., & Kiltz, E. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74143-5_31 · Cited by 306
Hsiang, H.-C., & Shih, W.-K. (2009) · Computer Standards & Interfaces · doi:10.1016/j.csi.2008.11.002 · Cited by 301
Generalized Compact Knapsacks Are Collision Resistant
Lyubashevsky, V., & Micciancio, D. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_13 · Cited by 268
SWIFFT: A Modest Proposal for FFT Hashing
Lyubashevsky, V., Micciancio, D., Peikert, C., & Rosen, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71039-4_4 · Cited by 265
Design and Implementation of Secure Networked Predictive Control Systems Under Deception Attacks
Pang, Z.-H., & Liu, G.-P. (2012) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2011.2160543 · Cited by 260
Hussein, A. F., ArunKumar, N., Ramirez-Gonzalez, G., Abdulhay, E., Tavares, J. M. R. S., & de Albuquerque, V. H. C. (2018) · Cognitive Systems Research · doi:10.1016/j.cogsys.2018.05.004 · Cited by 212
Preimage Attacks on One-Block MD4, 63-Step MD5 and More
Aoki, K., & Sasaki, Y. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-04159-4_7 · Cited by 182
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
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
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
An Overview of Perceptual Hashing
Farid, H. (2021) · Journal of Online Trust and Safety · doi:10.54501/jots.v1i1.24 · Cited by 70
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
Novel one round message authentication scheme for constrained IoT devices
Noura, H. N., Salman, O., Couturier, R., & Chehab, A. (2022) · Journal of Ambient Intelligence and Humanized Computing · doi:10.1007/s12652-021-02913-7 · Cited by 7
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.