The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
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
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“Email: teshrim@ucdavis.edu WWW: www.ece.ucdavis.edu/~teshrim/”
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
Parallel Collision Search with Cryptanalytic Applications
van Oorschot, P. C., & Wiener, M. J. (1999) · Journal of Cryptology · doi:10.1007/pl00003816 · Cited by 639
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
A construction of a cipher from a single pseudorandom permutation
Even, S., & Mansour, Y. (1997) · Journal of Cryptology · doi:10.1007/s001459900025 · Cited by 351
How to Protect DES Against Exhaustive Key Search
Kilian, J., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_20 · Cited by 187
Self-citationA construction of a cipher from a single pseudorandom permutation
Even, S., & Mansour, Y. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57332-1_17 · Cited by 185
How to Protect DES Against Exhaustive Key Search (an Analysis of DESX)
Kilian, J., & Rogaway, P. (2001) · Journal of Cryptology · doi:10.1007/s001450010015 · Cited by 148
Self-citationA Secure One-Way Hash Function Built from DES
Winternitz, R. S. (1984) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.1984.10027 · Cited by 105
Cited by
Rogaway, P., & Shrimpton, T. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-25937-4_24 · Cited by 614
Self-citationSecond Preimages on n-Bit Hash Functions for Much Less than 2 n Work
Kelsey, J., & Schneier, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11426639_28 · Cited by 374
Security Analysis of SHA-256 and Sisters
Gilbert, H., & Handschuh, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24654-1_13 · Cited by 347
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
XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
Buchmann, J., Dahmen, E., & Hülsing, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25405-5_8 · Cited by 312
Metadata
- Authors
- Black, J., Rogaway, P., & Shrimpton, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 320-335
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1863270349
- Cited by
- 337
- References
- 10
- FWCI
- 7.61
- 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.