The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Efficient Elliptic Curve Exponentiation Using Mixed Coordinates
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
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
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 2×
“Hence with current knowledge, we can construct elliptic curve cryptosystems over a smaller de nition eld than the discrete-logarithmproblem (DLP)-based cryptosystems like the ElGamal cryptosystems ([5]) or the DSA ([4]) and RSA cryptosystems ([19]).”
BackgroundMethodKoblitz, 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
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
A Course in Computational Algebraic Number Theory
Cohen, H. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-02945-9 · Cited by 2,567
Self-citationThe art of computer programming. Vol.2: Seminumerical algorithms
Knuth, D. E. (1981) · Virtual Defense Library (Ministerio de Defensa) · Cited by 1,232
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
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
Monte Carlo Methods for Index Computation (mod p)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.2307/2006496 · Cited by 367
The Discrete Logarithm Problem on Elliptic Curves of Trace One
Smart, N. P. (1999) · Journal of Cryptology · doi:10.1007/s001459900052 · Cited by 343
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
Speeding up the computations on an elliptic curve using addition-subtraction chains
Morain, F., & Olivos, J. (1990) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita/1990240605311 · Cited by 258
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
An 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
Efficient algorithms for elliptic curve cryptosystems
Guajardo, J., & Paar, C. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052247 · Cited by 140
Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
Koyama, K., & Tsuruoka, Y. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_25 · Cited by 113
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
Cited by
Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
Gura, N., Patel, A., Wander, A., Eberle, H., & Shantz, S. C. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28632-5_9 · Cited by 1,212
Faster Addition and Doubling on Elliptic Curves
Bernstein, D. J., & Lange, T. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-76900-2_3 · Cited by 442
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
Gallant, R. P., Lambert, R. J., & Vanstone, S. A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_11 · Cited by 376
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
Metadata
- Authors
- Cohen, H., Miyaji, A., & Ono, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1998
- Pages
- 51-65
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1539482743
- Cited by
- 296
- References
- 22
- FWCI
- 11.46
- 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
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.