The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Algorithms in Number Theory
Open accessAbstract
Publisher Summary This chapter discusses algorithms that solve two basic problems in computational number theory—factoring integers into prime factors and finding discrete logarithms. In the factoring problem, one is given an integer n 1 and is asked to find the decomposition of n into prime factors. It is common to split this problem into two parts. The first is called primality testing: given n , it is determined whether n is prime or composite. The second is called factorization: if n is composite, a nontrivial divisor of n is to be calculated. In the discrete logarithm problem, one is given a prime number p , and two elements h, y of the multiplicative group F* p of the field of integers modulo p. The algorithms and their analyses depend on many different parts of number theory. Number theory is considered the purest of all sciences, and within number theory the hunt for large primes and for factors of large numbers has always been remote from applications, even to other questions of a number-theoretic nature.
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. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
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
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
Pollard, J. M. (1978) · Mathematics of Computation · doi:10.1090/s0025-5718-1978-0491431-9 · Cited by 825
Cited by
Efficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Zheng, Y. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052234 · Cited by 1,250
A secure and optimally efficient multi‐authority election scheme
Cramer, R., Gennaro, R., & Schoenmakers, B. (1997) · European Transactions on Telecommunications · doi:10.1002/ett.4460080506 · Cited by 784
Factorization of a 768-Bit RSA Modulus
Kleinjung, T., Aoki, K., Franke, J., Lenstra, A. K., Thomé, E., Bos, J. W., Gaudry, P., Kruppa, A., Montgomery, P. L., Osvik, D. A., et al. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_18 · Cited by 423
Self-citationElliptic 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
Metadata
- Authors
- LENSTRA, A. K., & LENSTRA, H. W.
- Venue
- Algorithms and Complexity
- Publisher
- Elsevier
- Published
- 1990
- Pages
- 673-715
- OpenAlex
- W1983287134
- Cited by
- 169
- References
- 4
- FWCI
- 29.29
- Type
- book chapter
- Language
- en
- Open access
- green
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: Algorithms in Number Theory. https://app.cochat.ai/papers/10.1016/b978-0-444-88071-0.50017-5
- The paper
- LENSTRA, A. K., & LENSTRA, H. W. (1990). Algorithms in Number Theory. Algorithms and Complexity. https://doi.org/10.1016/b978-0-444-88071-0.50017-5
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.