The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Use of Elliptic Curves in Cryptography
Open accessOverview
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825
Solving sparse linear equations over finite fields
Wiedemann, D. (1986) · IEEE Transactions on Information Theory · doi:10.1109/tit.1986.1057137 · Cited by 546
Elliptic curves over finite fields and the computation of square roots mod 𝑝
Schoof, R. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777280-6 · Cited by 515
232Notes on elliptic curves. II
Birch, B. J., & Swinnerton-Dyer, H. P. F. (1965) · De Gruyter eBooks · doi:10.1515/9783111260440-013 · Cited by 426
Discrete logarithms in finite fields and their cryptographic significance
Odlyzko, A. M. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39757-4_20 · Cited by 367
Monte Carlo Methods for Index Computation (mod p)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.2307/2006496 · Cited by 367
Elliptic Curves: Diophantine Analysis
Lang, S. (1978) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-07010-9 · Cited by 273
Coppersmith, D., Odlzyko, A. M., & Schroeppel, R. (1986) · Algorithmica · doi:10.1007/bf01840433 · Cited by 271
Diophantine Equations with Special Reference To Elliptic Curves
Cassels, J. W. S. (1966) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-41.1.193 · Cited by 253
A subexponential algorithm for the discrete logarithm problem with applications to cryptography
Adleman, L. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.2 · Cited by 242
Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
Schoof, R. (1985) · Mathematics of Computation · doi:10.2307/2007968 · Cited by 187
211Notes on elliptic curves. I.
Birch, B. J., & Swinnerton-Dyer, H. P. F. (1963) · De Gruyter eBooks · doi:10.1515/9783111260440-012 · Cited by 160
Lower bound for the canonical height on elliptic curves
Silverman, J. H. (1981) · Duke Mathematical Journal · doi:10.1215/s0012-7094-81-04834-1 · Cited by 83
On the conjecture of Birch and Swinnerton-Dyer for an elliptic curve of rank 3
Buhler, J., Gross, B. H., & Zagier, D. B. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777279-x · Cited by 71
On the difference of the Weil height and the N�ron-Tate height
Zimmer, H. G. (1976) · Mathematische Zeitschrift · doi:10.1007/bf01214273 · Cited by 61
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Koblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634
The Arithmetic of Elliptic Curves
Silverman, J. H. (1986) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-1920-8 · Cited by 4,044
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Bitcoin and beyond: a technical survey on decentralized digital currencies
Tschorsch, F., & Scheuermann, B. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2535718 · Cited by 1,690
Metadata
- Authors
- Miller, V. S.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-02-28
- Pages
- 417-426
- OpenAlex
- W2003736153
- Cited by
- 3,946
- References
- 17
- FWCI
- 142.50
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.