The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
A Generalized Birthday Problem
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Lower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
Parallel Collision Search with Cryptanalytic Applications
van Oorschot, P. C., & Wiener, M. J. (1999) · Journal of Cryptology · doi:10.1007/pl00003816 · Cited by 639
A sieve algorithm for the shortest lattice vector problem
Ajtai, M., Kumar, R., & Sivakumar, D. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380857 · Cited by 558
Secure Human Identification Protocols
Hopper, N. J., & Blum, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_4 · Cited by 499
Fast correlation attacks on certain stream ciphers
Meier, W., & Staffelbach, O. (1989) · Journal of Cryptology · doi:10.1007/bf02252874 · Cited by 489
Practical Byzantine fault tolerance
de Castro, O. T., & Miguel, M. D. (2000) · Cited by 372
A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost
Bellare, M., & Micciancio, D. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_13 · Cited by 250
Improved Fast Correlation Attacks Using Parity-Check Equations of Weight 4 and 5
Canteaut, A., & Trabbia, M. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_40 · Cited by 245
Complexity of a determinate algorithm for the discrete logarithm
Nechaev, V. I. (1994) · Mathematical Notes · doi:10.1007/bf02113297 · Cited by 232
A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
Schroeppel, R., & Shamir, A. (1981) · SIAM Journal on Computing · doi:10.1137/0210033 · Cited by 204
Proactive recovery in a Byzantine-fault-tolerant system
Castro, M., & Liskov, B. H. (2000) · doi:10.5555/1251229.1251248 · Cited by 174
Fast Correlation Attacks: An Algorithmic Point of View
Chose, P., Joux, A., & Mitton, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_14 · Cited by 162
On the need for multipermutations: Cryptanalysis of MD4 and SAFER
Vaudenay, S. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-60590-8_22 · Cited by 161
Fast Correlation Attacks through Reconstruction of Linear Polynomials
Johansson, T., & Jönsson, F. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44598-6_19 · Cited by 147
A Simple Algorithm for Fast Correlation Attacks on Stream Ciphers
Chepyzhov, V. V., Johansson, T., & Smeets, B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44706-7_13 · Cited by 144
Yuval, G. (1979) · Cryptologia · doi:10.1080/0161-117991854025 · Cited by 139
How easy is collision search? Application to DES
Quisquater, J.-J., & Delescaille, J.-P. (2007) · Springer eBooks · doi:10.1007/3-540-46885-4_43 · Cited by 98
Why Textbook ElGamal and RSA Encryption Are Insecure
Boneh, D., Joux, A., & Nguyễn, P. Q. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44448-3_3 · Cited by 81
Computation of low-weight parity-check polynomials
Golić, J. D. (1996) · Electronics Letters · doi:10.1049/el:19961338 · Cited by 50
Computation of low-weight parity checks for correlation attacks on stream ciphers
Penzhorn, W. T., & Kühn, G. J. (1995) · Lecture notes in computer science · doi:10.1007/3-540-60693-9_10 · Cited by 30
Cited by
Better Key Sizes (and Attacks) for LWE-Based Encryption
Lindner, R., & Peikert, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19074-2_21 · Cited by 688
Micciancio, D., & Regev, O. (2009) · Post-Quantum Cryptography · doi:10.1007/978-3-540-88702-7_5 · Cited by 615
Noise-tolerant learning, the parity problem, and the statistical query model
Blum, A., Kalai, A., & Wasserman, H. (2003) · Journal of the ACM · doi:10.1145/792538.792543 · Cited by 598
ID-Based Blind Signature and Ring Signature from Pairings
Zhang, F., & Kim, K. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_33 · Cited by 530
Regev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
Metadata
- Authors
- Wagner, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2002
- Pages
- 288-304
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1548701190
- Cited by
- 539
- References
- 22
- FWCI
- 11.96
- 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.