The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Speeding the Pollard and elliptic curve methods of factorization
Open accessAbstract
Since 1974, several algorithms have been developed that attempt to factor a large number N by doing extensive computations modulo N and occasionally taking GCDs with N. These began with Pollard’s p − 1 and Monte Carlo methods. More recently, Williams published a p + 1 method, and Lenstra discovered an elliptic curve method (ECM). We present ways to speed all of these. One improvement uses two tables during the second phases of p ± 1 and ECM, looking for a match. Polynomial preconditioning lets us search a fixed table of size n with n / 2 + o ( n ) multiplications. A parametrization of elliptic curves lets Step 1 of ECM compute the x-coordinate of nP from that of P in about 9.3 log 2 n multiplications for arbitrary P.
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
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 15,999
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
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
Modular multiplication without trial division
Montgomery, P. L. (1985) · Mathematics of Computation · doi:10.1090/s0025-5718-1985-0777282-x · Cited by 2,669
Self-citationFast Probabilistic Algorithms for Verification of Polynomial Identities
Schwartz, J. T. (1980) · Journal of the ACM · doi:10.1145/322217.322225 · Cited by 1,701
Factoring Integers with Elliptic Curves
Lenstra, H. W. (1987) · The Annals of Mathematics · doi:10.2307/1971363 · Cited by 974
The Art of Computer Programming, Vol. 2
Knuth, D. E. (1981) · Medical Entomology and Zoology · Cited by 886
(1961) · The American Mathematical Monthly · doi:10.2307/2311524 · Cited by 872
Class number, a theory of factorization, and genera
Shanks, D. (1971) · Proceedings of Symposia in Pure Mathematics · doi:10.1090/pspum/020/0316385 · Cited by 518
A monte carlo method for factorization
Pollard, J. M. (1975) · BIT · doi:10.1007/bf01933667 · Cited by 402
Cited by
Factoring Integers with Elliptic Curves
Lenstra, H. W. (1987) · The Annals of Mathematics · doi:10.2307/1971363 · Cited by 974
Curve25519: New Diffie-Hellman speed records
Bernstein, D. J. (2006) · Lecture Notes in Computer Science · doi:10.1007/11745853_14 · Cited by 859
Cross-VM side channels and their use to extract private keys
Zhang, Y., Juels, A., Reiter, M. K., & Ristenpart, T. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382230 · Cited by 787
Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
Jao, D., & De Feo, L. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25405-5_2 · Cited by 634
The Montgomery Powering Ladder
Joye, M., & Yen, S.-M. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36400-5_22 · Cited by 496
Metadata
- Authors
- Montgomery, P. L.
- Venue
- Mathematics of Computation
- Publisher
- American Mathematical Society (AMS)
- Published
- 1987
- Volume
- 48
- Issue
- 177
- Pages
- 243-264
- ISSN
- 0025-5718 (ISSN-L)
- 1088-6842
- OpenAlex
- W1971605365
- Cited by
- 1,218
- References
- 21
- FWCI
- 24.42
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Speeding the Pollard and elliptic curve methods of factorization. https://app.cochat.ai/papers/10.1090/s0025-5718-1987-0866113-7
- The paper
- Montgomery, P. L. (1987). Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation. https://doi.org/10.1090/s0025-5718-1987-0866113-7
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.