The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
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
The random oracle methodology, revisited (preliminary version)
Canetti, R., Goldreich, O., & Halevi, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276741 · Cited by 715
PayWord and MicroMint: Two simple micropayment schemes
Rivest, R. L., & Shamir, A. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-62494-5_6 · Cited by 621
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
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
Analysis and design of cryptographic hash functions
Kasselman, P. R. (1999) · UpSpace Institutional Repository (University of Pretoria) · Cited by 338
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
Distinguisher and Related-Key Attack on the Full AES-256
Biryukov, A., Khovratovich, D., & Nikolić, I. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_14 · Cited by 329
BLAKE2: 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
- Joux, A.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 306-316
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W81015123
- Cited by
- 379
- References
- 14
- FWCI
- 12.79
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions. https://app.cochat.ai/papers/10.1007/978-3-540-28628-8_19
- The paper
- Joux, A. (2004). Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-28628-8_19
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.