The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.
The Elliptic Curve Digital Signature Algorithm (ECDSA)
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Self-citationA 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
Kocher, P., Jaffe, J., & Jun, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_25 · Cited by 7,407
Koblitz, N. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866109-5 · Cited by 5,634
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Kocher, P. C. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_9 · Cited by 4,387
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
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Introduction to Finite Fields and their Applications
Lidl, R., & Niederreiter, H. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172769 · Cited by 2,069
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
On the Importance of Checking Cryptographic Protocols for Faults
Boneh, D., DeMillo, R. A., & Lipton, R. J. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_4 · Cited by 1,496
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Authentication and authenticated key exchanges
Diffie, W., Van Oorschot, P. C., & Wiener, M. J. (1992) · Designs, Codes and Cryptography · doi:10.1007/bf00124891 · Cited by 1,154
Security Proofs for Signature Schemes
Pointcheval, D., & Stern, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_33 · Cited by 1,077
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-citationDIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION
Rabin, M. O. (1979) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,020
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
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825
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 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
A Survey of Fast Exponentiation Methods
Gordon, D. M. (1998) · Journal of Algorithms · doi:10.1006/jagm.1997.0913 · Cited by 534
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
RIPEMD-160: A strengthened version of RIPEMD
Dobbertin, H., Bosselaers, A., & Preneel, B. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60865-6_44 · Cited by 487
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-citationA Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols.
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Cited by 381
Bellare, M., Canetti, R., & Krawczyk, H. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276854 · Cited by 358
Efficient Arithmetic on Koblitz Curves
Solinas, J. A. (2000) · Designs, Codes and Cryptography · doi:10.1023/a:1008306223194 · Cited by 344
The Discrete Logarithm Problem on Elliptic Curves of Trace One
Smart, N. P. (1999) · Journal of Cryptology · doi:10.1007/s001459900052 · Cited by 343
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
Constructive and destructive facets of Weil descent on elliptic curves
Gaudry, P., Hess, F., & Smart, N. P. (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0011-x · Cited by 300
Cryptanalytic Attacks on Pseudorandom Number Generators
Kelsey, J. M., Schneier, B., Wagner, D., & Hall, C. (1998) · Lecture notes in computer science · doi:10.1007/3-540-69710-1_12 · Cited by 293
Software Implementation of the NIST Elliptic Curves Over Prime Fields
Brown, M., Hankerson, D., López, J., & Menezes, A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_19 · Cited by 258
Self-citationAn Improved Protocol for Demonstrating Possession of Discrete Logarithms and Some Generalizations
Chaum, D., Evertse, J.-H., & Graaf, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/3-540-39118-5_13 · Cited by 246
Semaev, 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
A new signature scheme based on the DSA giving message recovery
Nyberg, K., & Rueppel, R. A. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168595 · Cited by 221
A key recovery attack on discrete log-based schemes using a prime order subgroup
Lim, C. H., & Lee, P. J. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052240 · Cited by 207
Balasubramanian, R., & Koblitz, N. (1998) · Journal of Cryptology · doi:10.1007/s001459900040 · Cited by 202
Unknown Key-Share Attacks on the Station-to-Station (STS) Protocol
Blake-Wilson, S., & Menezes, A. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49162-7_12 · Cited by 197
Self-citationRivest, R. L., Hellman, M. E., Anderson, J. C., & Lyons, J. W. (1992) · Communications of the ACM · doi:10.1145/129902.129905 · Cited by 187
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
Message Recovery for Signature Schemes Based on the Discrete Logarithm Problem
Nyberg, K., & Rueppel, R. A. (1996) · Designs Codes and Cryptography · doi:10.1007/bf00125076 · Cited by 153
Ash, D., Blake, I. F., & Vanstone, S. A. (1989) · Discrete Applied Mathematics · doi:10.1016/0166-218x(89)90001-2 · Cited by 152
Self-citationAdleman, 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
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 145
Speeding up Pollard's rho method for computing discrete logarithms
Teske, E. (1998) · Lecture notes in computer science · doi:10.1007/bfb0054891 · Cited by 137
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-citationPgp in constrained wireless devices
Brown, M., Cheung, D., Hankerson, D., Hernandez, J. L., Kirkup, M., & Menezes, A. (2000) · Cited by 107
Self-citationDesign Validations for Discrete Logarithm Based Signature Schemes
Brickell, E. F., Pointcheval, D., Serge Vaudenay, B., & Yung, M. M. (2000) · Lecture notes in computer science · doi:10.1007/978-3-540-46588-1_19 · Cited by 106
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
A Cryptographic Application of Weil Descent
Galbraith⋆, S. D., & Smart, N. P. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46665-7_23 · Cited by 80
Applications of Arithmetical Geometry to Cryptographic Constructions
Frey, G. (2001) · Springer eBooks · doi:10.1007/978-3-642-56755-1_13 · Cited by 80
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
Efficient Multiplication on Certain Nonsupersingular Elliptic Curves
Meier, W., & Staffelbach, O. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_24 · Cited by 69
Analysis of the Weil Descent Attack of Gaudry, Hess and Smart
Menezes, A., & Qu, M. (1999) · Lecture notes in computer science · doi:10.1007/3-540-45353-9_23 · Cited by 68
Self-citationBuilding 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
Constructing Elliptic Curve Cryptosystems in Characteristic 2
Koblitz, N. (2007) · Springer eBooks · doi:10.1007/3-540-38424-3_11 · Cited by 61
Counting 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
Designing and Detecting Trapdoors for Discrete Log Cryptosystems
Gordon, D. M. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_5 · Cited by 33
Response to Comments on the NIST Proposed Digital Signature Standard
Smid, M. E., & Branstad, D. K. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_6 · Cited by 25
Efficient Implementation of Schoof’s Algorithm
Izu, T., Kogure, J., Noro, M., et al. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49649-1_7 · Cited by 24
Finding good random elliptic curves for cryptosystems defined over IF 2 n
Lercier, R. (1997) · Cited by 20
Computing isogenies in F 2 nPreprint
Lercier, R. (1996) · Cited by 18
The Eurocrypt’92 Controversial Issue Trapdoor Primes and Moduli
(2007) · Springer eBooks · doi:10.1007/3-540-47555-9_17 · Cited by 11
Cited by
An Overview of Blockchain Technology: Architecture, Consensus, and Future Trends
Zheng, Z., Xie, S., Dai, H., Chen, X., & Wang, H. (2017) · 2017 IEEE International Congress on Big Data (BigData Congress) · doi:10.1109/bigdatacongress.2017.85 · Cited by 4,515
Blockchain challenges and opportunities: a survey
Zheng, Z., Xie, S., Dai, H. N., Chen, X., & Wang, H. (2018) · International Journal of Web and Grid Services · doi:10.1504/ijwgs.2018.095647 · Cited by 3,651
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Decentralizing Privacy: Using Blockchain to Protect Personal Data
Zyskind, G., Nathan, O., & Pentland, A. '. (2015) · 2015 IEEE Security and Privacy Workshops · doi:10.1109/spw.2015.27 · Cited by 2,617
Blockchain for internet of things: a survey
Dai, H.-N., Zheng, Z., & Zhang, Y. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2920987 · Cited by 1,246
Metadata
- Authors
- Johnson, D., Menezes, A., & Vanstone, S.
- Venue
- International Journal of Information Security
- Published
- 2001-08
- Volume
- 1
- Issue
- 1
- Pages
- 36-63
- ISSN
- 1615-5262 (ISSN-L)
- OpenAlex
- W2013613544
- Cited by
- 2,239
- References
- 69
- FWCI
- 44.41
- 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.