The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Elliptic Curve Public Key Cryptosystems
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A., Vanstone, S., & Okamoto, T. (1991) · Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 · doi:10.1145/103418.103434 · Cited by 337
Self-citation
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Self-citationGuide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
The Elliptic Curve Digital Signature Algorithm (ECDSA)
Johnson, D., Menezes, A., & Vanstone, S. (2001) · International Journal of Information Security · doi:10.1007/s102070100002 · Cited by 2,239
Self-citationAriadne: a secure on-demand routing protocol for ad hoc networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570648 · Cited by 1,298
Efficient Algorithms for Pairing-Based Cryptosystems
Barreto, P. S. L. M., Kim, H. Y., Lynn, B., & Scott, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_23 · Cited by 1,069
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
Resistance Against Differential Power Analysis For Elliptic Curve Cryptosystems
Coron, J.-S. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48059-5_25 · Cited by 965
An Identity-Based Signature from Gap Diffie-Hellman Groups
Choon, J. C., & Hee Cheon, J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_2 · Cited by 917
The State of Elliptic Curve Cryptography
Koblitz, N., Menezes, A., & Vanstone, S. (2000) · Designs, Codes and Cryptography · doi:10.1023/a:1008354106356 · Cited by 685
Self-citationA Survey of Fast Exponentiation Methods
Gordon, D. M. (1998) · Journal of Algorithms · doi:10.1006/jagm.1997.0913 · Cited by 534
Fast Multiplication on Elliptic Curves Over GF(2m) without precomputation
López, J., & Dahab, R. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48059-5_27 · Cited by 482
A Taxonomy of Pairing-Friendly Elliptic Curves
Freeman, D., Scott, M., & Teske, E. (2010) · Journal of Cryptology · doi:10.1007/s00145-009-9048-z · Cited by 466
Security in embedded systems: Design challenges
Ravi, S., Raghunathan, A., Kocher, P., & Hattangady, S. (2004) · ACM Transactions on Embedded Computing Systems · doi:10.1145/1015047.1015049 · Cited by 463
A One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0312-y · Cited by 452
Shor's discrete logarithm quantum algorithm for elliptic curves
Proos, J., & Zalka, C. (2003) · Quantum Information and Computation · doi:10.26421/qic3.4-3 · Cited by 421
Applications of multilinear forms to cryptography
Boneh, D., & Silverberg, A. (2003) · Contemporary Mathematics · doi:10.1090/conm/324/05731 · Cited by 395
Differential Fault Attacks on Elliptic Curve Cryptosystems
Biehl, I., Meyer, B., & Müller, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_8 · Cited by 323
Pairing-Based Cryptography at High Security Levels
Koblitz, N., & Menezes, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11586821_2 · Cited by 317
Self-citationMontgomery Multiplication in GF(2k)
Koc, C. K., & Acar, T. (1998) · Designs, Codes and Cryptography · doi:10.1023/a:1008208521515 · Cited by 266
Blake, I., Heegard, C., Hoholdt, T., & Wei, V. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720550 · Cited by 265
Wahono (2007) · doi:10.3923/jse.2007.1.12 · Cited by 113
Fair and Transparent Blockchain Based Tendering Framework - A Step Towards Open Governance
Hardwick, F. S., Akram, R. N., & Markantonakis, K. (2018) · 2018 17th IEEE International Conference On Trust, Security And Privacy In Computing And Communications/ 12th IEEE International Conference On Big Data Science And Engineering (TrustCom/BigDataSE) · doi:10.1109/trustcom/bigdatase.2018.00185 · Cited by 48
Metadata
- Authors
- Menezes, A.
- Venue
- Springer eBooks
- Publisher
- Springer US
- Published
- 1993
- OpenAlex
- W2128718974
- Cited by
- 852
- References
- 1
- FWCI
- 14.92
- Type
- book
- 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.