The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Selecting Cryptographic Key Sizes: Extended Abstract
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
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
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
A One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722028_23 · Cited by 1,039
Parallel Collision Search with Cryptanalytic Applications
van Oorschot, P. C., & Wiener, M. J. (1999) · Journal of Cryptology · doi:10.1007/pl00003816 · Cited by 639
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
Diffie, W., & Hellman, M. E. (1977) · Computer · doi:10.1109/c-m.1977.217750 · Cited by 567
Anderson, R. (1994) · Communications of the ACM · doi:10.1145/188280.188291 · Cited by 358
A fast new DES implementation in software
Biham, E. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052352 · Cited by 328
Complexity of a determinate algorithm for the discrete logarithm
Nechaev, V. I. (1994) · Mathematical Notes · doi:10.1007/bf02113297 · Cited by 232
Faster Attacks on Elliptic Curve Cryptosystems
Wiener, M. J., & Zuccherato, R. J. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48892-8_15 · Cited by 163
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Verheul, E. R. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_13 · Cited by 150
Self-citation
Cited by
Selecting Cryptographic Key Sizes
Lenstra, A. K., & Verheul, E. R. (2001) · Journal of Cryptology · doi:10.1007/s00145-001-0009-4 · Cited by 784
Self-citationA Security and Privacy Review of VANETs
Qu, F., Wu, Z., Wang, F., & Cho, W. (2015) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2439292 · Cited by 478
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
Kong, J., & Hong, X. (2003) · Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing · doi:10.1145/778415.778449 · Cited by 432
RFID-Tags for Anti-counterfeiting
Tuyls, P., & Batina, L. (2006) · Lecture Notes in Computer Science · doi:10.1007/11605805_8 · Cited by 388
Self-securing ad hoc wireless networks
Luo, H., Zerfos, P., Kong, J., Lu, S., & Zhang, L. (2003) · Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications · doi:10.1109/iscc.2002.1021731 · Cited by 358
Metadata
- Authors
- Lenstra, A. K., & Verheul, E. R.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 446-465
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1490476950
- Cited by
- 265
- References
- 15
- FWCI
- 17.47
- 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: Selecting Cryptographic Key Sizes: Extended Abstract. https://app.cochat.ai/papers/10.1007/978-3-540-46588-1_30
- The paper
- Lenstra, A. K., & Verheul, E. R. (2000). Selecting Cryptographic Key Sizes: Extended Abstract. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-46588-1_30
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.
