The DOI matches its Crossref record; 65 of the 65 references it cites were found in a registry or an index.
The State of Elliptic Curve Cryptography
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059 · cited 4×
“” It is not hard to modify the Diffie–Hellman protocol for the purpose of message transmission, using an idea of ElGamal [16].”
BackgroundMethodInfluentialKoblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634
Self-citationThe Arithmetic of Elliptic Curves
Silverman, J. H. (1986) · Graduate Texts in Mathematics · doi:10.1007/978-1-4757-1920-8 · Cited by 4,044
Use of Elliptic Curves in Cryptography
Miller, V. S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x_31 · Cited by 3,946
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Elliptic Curves in Cryptography
Blake, I. F., Seroussi, G., & Smart, N. P. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9781107360211 · Cited by 1,828
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A. J., Okamoto, T., & Vanstone, S. A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259647 · Cited by 1,022
Self-citationFactoring Integers with Elliptic Curves
Lenstra, H. W. (1987) · The Annals of Mathematics · doi:10.2307/1971363 · Cited by 974
Introduction to Elliptic Curves and Modular Forms
Koblitz, N. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0909-6 · Cited by 964
Self-citationModular curves and the Eisenstein ideal
Mazur, B. (1977) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02684339 · Cited by 945
Elliptic Curve Public Key Cryptosystems
Menezes, A. (1993) · Springer eBooks · doi:10.1007/978-1-4615-3198-2 · Cited by 852
Self-citationA Course in Number Theory and Cryptography
Koblitz, N. (1987) · Graduate Texts in Mathematics · doi:10.1007/978-1-4684-0310-7 · Cited by 839
Self-citationMonte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825 · cited 1×
“The best algorithm known to date for ECDLP is the Pollard ‰-method [ 63 ], as modified by Gallant, Lambert and Vanstone [18], and Wiener and Zuccherato [82], which takes about . p … n/=2 steps, where a step here is an elliptic”
MethodParallel Collision Search with Cryptanalytic Applications
van Oorschot, P. C., & Wiener, M. J. (1999) · Journal of Cryptology · doi:10.1007/pl00003816 · Cited by 639
A Course in Number Theory and Cryptography
Koblitz, N. (1994) · Graduate Texts in Mathematics · doi:10.1007/978-1-4419-8592-7 · Cited by 576
Self-citationA Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
Frey, G., & Ruck, H.-G. (1994) · Mathematics of Computation · doi:10.2307/2153546 · Cited by 551
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
Koblitz, N. (1989) · Journal of Cryptology · doi:10.1007/bf02252872 · Cited by 455
Self-citationThe Discrete Logarithm Problem on Elliptic Curves of Trace One
Smart, N. P. (1999) · Journal of Cryptology · doi:10.1007/s001459900052 · Cited by 343
Algebraic aspects of cryptography
(1998) · Choice Reviews Online · doi:10.5860/choice.36-2204 · Cited by 336
Optimal normal bases in GF(pn)
Mullin, R. C., Onyszchuk, I. M., Vanstone, S. A., & Wilson, R. M. (1988) · Discrete Applied Mathematics · doi:10.1016/0166-218x(88)90090-x · Cited by 324
Self-citationDiscrete Logarithms in $GF ( P )$ Using the Number Field Sieve
Gordon, D. M. (1993) · SIAM Journal on Discrete Mathematics · doi:10.1137/0406010 · Cited by 322
Fast evaluation of logarithms in fields of characteristic two
Coppersmith, D. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056941 · Cited by 297
Nonsingular plane cubic curves over finite fields
Schoof, R. (1987) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(87)90003-3 · Cited by 268
Algebraic Aspects of Cryptography
Koblitz, N. (1998) · Algorithms and Computation in Mathematics · doi:10.1007/978-3-662-03642-6 · Cited by 267
Self-citationSemaev, I. (1998) · Mathematics of Computation · doi:10.1090/s0025-5718-98-00887-4 · Cited by 234
Fast Key Exchange with Elliptic Curve Systems
Schroeppel, R., Orman, H., O’Malley, S., & Spatscheck, O. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_4 · Cited by 231
An implementation of elliptic curve cryptosystems over F/sub 2/155
Agnew, G. B., Mullin, R. C., & Vanstone, S. A. (1993) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.223883 · Cited by 212
Self-citationBalasubramanian, R., & Koblitz, N. (1998) · Journal of Cryptology · doi:10.1007/s001459900040 · Cited by 202
Self-citationAlmost all primes can be quickly certified
Goldwasser, S., & Kilian, J. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12162 · Cited by 198
An implementation for a fast public-key cryptosystem
Agnew, G. B., Mullin, R. C., Onyszchuk, I. M., & Vanstone, S. A. (1991) · Journal of Cryptology · doi:10.1007/bf00196789 · Cited by 196
Self-citationA key distribution system equivalent to factoring
McCurley, K. S. (1988) · Journal of Cryptology · doi:10.1007/bf02351718 · Cited by 176
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
Koyama, K., Maurer, U. M., Okamoto, T., & Vanstone, S. A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46766-1_20 · Cited by 170
Self-citationAlgorithms for Black-Box Fields and their Application to Cryptography
Boneh, D., & Lipton, R. J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_22 · Cited by 167
Discrete logarithms and local units
Schirokauer, O. (1993) · Philosophical Transactions of the Royal Society of London Series A Physical and Engineering Sciences · doi:10.1098/rsta.1993.0139 · Cited by 165
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
Elliptic curve cryptosystems and their implementation
Menezes, A. J., & Vanstone, S. A. (1993) · Journal of Cryptology · doi:10.1007/bf00203817 · Cited by 159
Self-citationAn improved algorithm for arithmetic on a family of elliptic curves
Solinas, J. A. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052248 · Cited by 152
Adleman, L. M., DeMarrais, J., & Huang, M.-D. A. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58691-1_39 · Cited by 149
Parallel collision search with application to hash functions and discrete logarithms
van Oorschot, P. C., & Wiener, M. J. (1994) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/191177.191231 · Cited by 146
A key-exchange system based on imaginary quadratic fields
Buchmann, J. A., & Williams, H. C. (1988) · Journal of Cryptology · doi:10.1007/bf02351719 · Cited by 144
Efficient algorithms for elliptic curve cryptosystems
Guajardo, J., & Paar, C. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052247 · Cited by 140
Improving the parallelized Pollard lambda search on anomalous binary curves
Gallant, R. P., Lambert, R., & Vanstone, S. A. (1999) · Mathematics of Computation · doi:10.1090/s0025-5718-99-01119-9 · Cited by 124
Self-citationBlaze, M., Diffie, W., Rivest, R. L., Schneier, B., & Shimomura, T. (1996) · Defense Technical Information Center (DTIC) · doi:10.21236/ada385264 · Cited by 123
Optimal extension fields for fast arithmetic in public-key algorithms
Bailey, D. V., & Paar, C. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055748 · Cited by 111
On the performance of signature schemes based on elliptic curves
Win, E. D., Mister, S., Preneel, B., & Wiener, M. J. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054867 · Cited by 97
Elliptic Curve Discrete Logarithms and the Index Calculus
Silverman, J. H., & Suzuki, J. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49649-1_10 · Cited by 89
The Xedni Calculus and the Elliptic Curve Discrete Logarithm Problem
Silverman, J. H. (2000) · Designs Codes and Cryptography · doi:10.1023/a:1008319518035 · Cited by 77
Public-Key Cryptosystems with Very Small Key Lengths
Harper, G., Menezes, A., & Vanstone, S. A. (2007) · Springer eBooks · doi:10.1007/3-540-47555-9_14 · Cited by 71
Self-citationEfficient Multiplication on Certain Nonsupersingular Elliptic Curves
Meier, W., & Staffelbach, O. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_24 · Cited by 69
Building Cyclic Elliptic Curves Modulo Large Primes
Morain, F. (2007) · Springer eBooks · doi:10.1007/3-540-46416-6_28 · Cited by 65
Analysis of the Xedni Calculus Attack
Jacobson, M. J., Koblitz, N., Silverman, J. H., et al. (2000) · Designs Codes and Cryptography · doi:10.1023/a:1008312401197 · Cited by 65
Self-citationConstructing Elliptic Curve Cryptosystems in Characteristic 2
Koblitz, N. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_11 · Cited by 61
Self-citationCounting the number of points on elliptic curves over finite fields: strategies and performances
Lercier, R., & Morain, F. (1995) · Lecture notes in computer science · doi:10.1007/3-540-49264-x_7 · Cited by 57
One-way permutations on elliptic curves
Kaliski, B. S. (1991) · Journal of Cryptology · doi:10.1007/bf00196911 · Cited by 48
Elliptic curve implementation of zero-knowledge blobs
Koblitz, N. (1991) · Journal of Cryptology · doi:10.1007/bf00196728 · Cited by 28
Self-citationFinding good random elliptic curves for cryptosystems defined over IF 2 n
Lercier, R. (1997) · Cited by 20
Extending the Wiener attack to RSA-type cryptosystems
Pinch, R. G. E. (1995) · Electronics Letters · doi:10.1049/el:19951199 · Cited by 19
Low exponent attack against elliptic curve RSA
Kurosawa, K., Okada, K., & Tsujii, S. (1995) · Lecture notes in computer science · doi:10.1007/bfb0000449 · Cited by 19
Computing isogenies in F 2 nPreprint
Lercier, R. (1996) · Cited by 18
Finding Good Random Elliptic Curves for Cryptosystems Defined over $$ \mathbb{F}_{{\text{2}}^n } $$
Lercier, R. (1997) · Lecture notes in computer science · doi:10.1007/3-540-69053-0_26 · Cited by 16
Computing isogenies in $$\mathbb{F}_{2^n } $$
Lercier, R. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61581-4_55 · Cited by 14
van der Geer, G. (1991) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0441-1_10 · Cited by 8
Cited by
A data mining framework for building intrusion detection models
Lee, W., Stolfo, S. J., & Mok, K. W. (2003) · Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344) · doi:10.1109/secpri.1999.766909 · Cited by 1,148
Software Implementation of Elliptic Curve Cryptography over Binary Fields
Hankerson, D., López Hernandez, J., & Menezes, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44499-8_1 · Cited by 423
Self-citationShen, J., Gui, Z., Ji, S., Shen, J., Tan, H., & Tang, Y. (2018) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2018.01.003 · Cited by 267
Federated learning for secure IoMT-applications in smart healthcare systems: A comprehensive review
Rani, S., Kataria, A., Kumar, S., & Tiwari, P. (2023) · Knowledge-Based Systems · doi:10.1016/j.knosys.2023.110658 · Cited by 228
A novel image encryption scheme based on an elliptic curve
Hayat, U., & Azam, N. A. (2019) · Signal Processing · doi:10.1016/j.sigpro.2018.10.011 · Cited by 178
Metadata
- Authors
- Koblitz, N., Menezes, A., & Vanstone, S.
- Venue
- Designs, Codes and Cryptography
- Published
- 2000-03
- Volume
- 19
- Issue
- 2-3
- Pages
- 173-193
- ISSN
- 0925-1022 (ISSN-L)
- 1573-7586
- OpenAlex
- W1754939103
- Cited by
- 685
- References
- 65
- FWCI
- 23.56
- Type
- journal article
- 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.