The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Reducing elliptic curve logarithms to logarithms in a finite field
Abstract
Elliptic curve cryptosystems have the potential to provide relatively small block size, high-security public key schemes that can be efficiently implemented. As with other known public key schemes, such as RSA and discrete exponentiation in a finite field, some care must be exercised when selecting the parameters involved, in this case the elliptic curve and the underlying field. Specific classes of curves that give little or no advantage over previously known schemes are discussed. The main result of the paper is to demonstrate the reduction of the elliptic curve logarithm problem to the logarithm problem in the multiplicative group of an extension of the underlying finite field. For the class of supersingular elliptic curves, the reduction takes probabilistic polynomial time, thus providing a probabilistic subexponential time algorithm for the former problem.>
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
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
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
Approximate formulas for some functions of prime numbers
Rosser, J. B., & Schoenfeld, L. (1962) · Illinois Journal of Mathematics · doi:10.1215/ijm/1255631807 · Cited by 1,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
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
Discrete 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
Lenstra, A. K., Lenstra, H. W., Manasse, M. S., & Pollard, J. M. (1990) · Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 · doi:10.1145/100216.100295 · Cited by 285
Coppersmith, D., Odlzyko, A. M., & Schroeppel, R. (1986) · Algorithmica · doi:10.1007/bf01840433 · Cited by 271
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
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
The Multiple Polynomial Quadratic Sieve
Silverman, R. D. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866119-8 · Cited by 159
Probabilistic algorithms in finite fields
Ben-Or, M. (1981) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1981.37 · Cited by 159
Elliptic curve cryptosystems and their implementation
Menezes, A. J., & Vanstone, S. A. (1993) · Journal of Cryptology · doi:10.1007/bf00203817 · Cited by 159
Self-citationFast, Rigorous Factorization and Discrete Logarithm Algorithms
Pomerance, C. B. (1987) · Elsevier eBooks · doi:10.1016/b978-0-12-386870-1.50014-9 · Cited by 97
Massively Parallel Computation of Discrete Logarithms
Gordon, D. M., & McCurley, K. S. (2007) · Springer eBooks · doi:10.1007/3-540-48071-4_22 · Cited by 57
A subexponential-time algorithm for computing discrete logarithms overGF(p^2)
ElGamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057075 · Cited by 55
Fast Computation of Discrete Logarithms in GF (q)
Hellman, M. E., & Reyneri, J. M. (1983) · Springer eBooks · doi:10.1007/978-1-4757-0602-4_1 · Cited by 37
The implementation of elliptic curve cryptosystems
Menezes, A., & Vanstone, S. A. (2006) · Springer eBooks · doi:10.1007/bfb0030345 · Cited by 36
Self-citationElliptic curves and cryptography : a pseudorandom bit generator and other tools
Kaliski, B. S. (1988) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 32
On the Implementation of Elliptic Curve Cryptosystems
Bender, A. O., & Castagnoli, G. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_18 · Cited by 18
Cited by
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Guide 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-citation
Metadata
- Authors
- Menezes, A. J., Okamoto, T., & Vanstone, S. A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1993
- Volume
- 39
- Issue
- 5
- Pages
- 1639-1646
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2111310412
- Cited by
- 1,022
- References
- 22
- FWCI
- 15.03
- 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.