The DOI matches its Crossref record.
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
Open accessOverview
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
Cited by
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
Efficient Cache Attacks on AES, and Countermeasures
Tromer, E., Osvik, D. A., & Shamir, A. (2010) · Journal of Cryptology · doi:10.1007/s00145-009-9049-y · Cited by 444
Self-citationThe most dangerous code in the world: validating SSL certificates in non-browser software
Georgiev, M., Iyengar, S., Jana, S., Anubhai, R., Boneh, D., & Shmatikov, V. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382204 · Cited by 413
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
Self-citationBLAKE2: Simpler, Smaller, Fast as MD5
Aumasson, J.-P., Neves, S., Wilcox-O’Hearn, Z., & Winnerlein, C. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38980-1_8 · Cited by 303
Metadata
- Authors
- Stevens, M., Sotirov, A., Appelbaum, J., Lenstra, A., Molnar, D., Osvik, D. A., & de Weger, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2009
- Pages
- 55-69
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2146923862
- Cited by
- 183
- References
- 0
- FWCI
- 18.10
- Type
- conference paper
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. https://app.cochat.ai/papers/10.1007/978-3-642-03356-8_4
- The paper
- Stevens, M., Sotirov, A., Appelbaum, J., Lenstra, A., Molnar, D., Osvik, D. A., & de Weger, B. (2009). Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-03356-8_4
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.