The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
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
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
Parallel Collision Search with Cryptanalytic Applications
van Oorschot, P. C., & Wiener, M. J. (1999) · Journal of Cryptology · doi:10.1007/pl00003816 · Cited by 639
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
Hash functions based on block ciphers: a synthetic approach
Preneel, B., Govaerts, R., & Vandewalle, J. P. L. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_31 · Cited by 421
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
Joux, A. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_19 · Cited by 379
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
Black, J., Rogaway, P., & Shrimpton, T. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_21 · Cited by 337
Schneier, B. (2015) · Wiley eBooks · doi:10.1002/9781119183471.ch18 · Cited by 236
Self-citationA fast software one-way hash function
Merkle, R. C. (1990) · Journal of Cryptology · doi:10.1007/bf00203968 · Cited by 132
Formal aspects of mobile code security
Appel, A. W., & Dean, R. (1999) · Cited by 128
Tiger: A fast new hash function
Anderson, R., & Biham, E. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60865-6_46 · Cited by 103
Kelsey, J. M., Schneier, B., & Ferguson, N. (2000) · Lecture notes in computer science · doi:10.1007/3-540-46513-8_2 · Cited by 103
Self-citationImproving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
van Oorschot, P. C., & Wiener, M. J. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_18 · Cited by 44
Cited by
On the Indifferentiability of the Sponge Construction
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_11 · Cited by 425
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
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
Metadata
- Authors
- Kelsey, J., & Schneier, B.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2005
- Pages
- 474-490
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1533007301
- Cited by
- 374
- References
- 19
- FWCI
- 18.60
- 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.