The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Factoring Integers with Elliptic Curves
Abstract
This paper 19 devoted to the deacnption and analysis of a new algonthm to factor positive mtegers It depends on the use of elliptic curves The new m et b öd α obtained from Pollird's p-1-method (Proc Cambridge Philos Soc 76 (187-1), 521-528) by replacing the multiplicative group by tbe group of points on a random elliptic curve 1t u conjectured thit the algonthm determmes a non-tnvial divuor of a composite number n m expected time at most K(p)(logn)2, where p is the least pnme dmding n and K u a function for which logK(t)=v'(2+o(l))logiloElogz for t->oo In the worst case, when n la the product of two pnmes of the same order of magnitude, this is exp((l+o(l))\/lognloglogn) (for n->oo) There are several other factonng algonthms of which the conjectural expected running time is given by the latter formula However, these algonthms have a running time (hat is basically lodependent of the size of the pnme factors of n, whereas the new elliptic curve method is subatantially faster for amall p
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
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
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
The Arithmetic of Elliptic Curves
Silverman, J. H. (2009) · Graduate texts in mathematics · doi:10.1007/978-0-387-09494-6 · Cited by 2,233
Introduction to the Arithmetic Theory of Automorphic Functions
Tretkoff, M., & Shimura, G. (1972) · Mathematics of Computation · doi:10.2307/2005900 · Cited by 2,010
An Introduction to the Theory of Numbers.
LeVeque, W. J., Niven, I., & Zuckerman, H. S. (1961) · The American Mathematical Monthly · doi:10.2307/2311171 · Cited by 1,907
Speeding the Pollard and elliptic curve methods of factorization
Montgomery, P. L. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866113-7 · Cited by 1,218
Arithmetic moduli of elliptic curves
Katz, N. M., & Mazur, B. (1985) · Medical Entomology and Zoology · Cited by 632
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
Theorems on factorization and primality testing
Pollard, J. M. (1974) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100049252 · Cited by 402
Prime Numbers and Computer Methods for Factorization
Riesel, H. (1985) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4757-1089-2 · Cited by 377
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Fully Homomorphic Encryption over the Integers
van Dijk, M., Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_2 · Cited by 1,858
Speeding the Pollard and elliptic curve methods of factorization
Montgomery, P. L. (1987) · Mathematics of Computation · doi:10.1090/s0025-5718-1987-0866113-7 · Cited by 1,218
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
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
The State of Elliptic Curve Cryptography
Koblitz, N., Menezes, A., & Vanstone, S. (2000) · Designs, Codes and Cryptography · doi:10.1023/a:1008354106356 · Cited by 685
Information and computation: Classical and quantum aspects
Galindo, A., & Martín-Delgado, M. A. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.347 · Cited by 552
Elliptic curves and primality proving
Atkin, A. O. L., & Morain, F. (1993) · Mathematics of Computation · doi:10.1090/s0025-5718-1993-1199989-x · Cited by 399
Batch Fully Homomorphic Encryption over the Integers
Cheon, J. H., Coron, J.-S., Kim, J., Lee, M. S., Lepoint, T., Tibouchi, M., & Yun, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_20 · Cited by 352
A new public key cryptosystem based on higher residues
Naccache, D., & Stern, J. (1998) · Proceedings of the 5th ACM conference on Computer and communications security · doi:10.1145/288090.288106 · Cited by 352
Differential Fault Attacks on Elliptic Curve Cryptosystems
Biehl, I., Meyer, B., & Müller, V. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_8 · Cited by 323
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
Pairing-Based Cryptography at High Security Levels
Koblitz, N., & Menezes, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11586821_2 · Cited by 317
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
Self-citationSpeeding 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
Factoring integers with the number field sieve
Buhler, J. P., Lenstra, H. W., & Pomerance, C. (1993) · Lecture Notes in Mathematics · doi:10.1007/bfb0091539 · Cited by 188
Self-citationAn Injective S-Box Design Scheme over an Ordered Isomorphic Elliptic Curve and Its Characterization
Azam, N. A., Hayat, U., & Ullah, I. (2018) · Security and Communication Networks · doi:10.1155/2018/3421725 · Cited by 56
New applications of the polynomial method: The cap set conjecture and beyond
Grochow, J. (2018) · Bulletin of the American Mathematical Society · doi:10.1090/bull/1648 · Cited by 16
Metadata
- Authors
- Lenstra, H. W.
- Venue
- The Annals of Mathematics
- Publisher
- JSTOR
- Published
- 1987-11
- Volume
- 126
- Issue
- 3
- Pages
- 649
- ISSN
- 0003-486X (ISSN-L)
- OpenAlex
- W2005317356
- Cited by
- 974
- References
- 15
- FWCI
- 48.84
- 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.