The development of the number field sieve

Open access

·1993·Lecture Notes in Mathematics

DOI 10.1007/bfb0091534

Open this paper in CoChat — free account

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

Crossref · 10.1007/bfb0091534

Cites

Statistics

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.

Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
Okamoto, T., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_8 · Cited by 477
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-citation
On the Exact Security of Full Domain Hash
Coron, J.-S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_14 · Cited by 347
Quantum algorithms for algebraic problems
Childs, A. M., & van Dam, W. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1 · Cited by 344
Bulk quantum computation with nuclear magnetic resonance: theory and experiment
Chuang, I. L., Gershenfeld, N., Kubinec, M. G., & Leung, D. W. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0170 · Cited by 316
Quantum Computers, Factoring, and Decoherence
Chuang, I. L., Laflamme, R., Shor, P. W., & Zurek, W. H. (1995) · Science · doi:10.1126/science.270.5242.1633 · Cited by 289
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
Roetteler, M., Naehrig, M., Svore, K. M., & Lauter, K. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70697-9_9 · Cited by 212
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment
Boudot, F., Gaudry, P., Guillevic, A., Heninger, N., Thomé, E., & Zimmermann, P. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-56880-1_3 · Cited by 71
Analysis of RSA and Shor’s algorithm for cryptography: A quantum perspective
Kute, S., Desai, C., & Jadhav, M. (2024) · AIP Conference Proceedings · doi:10.1063/5.0227773 · Cited by 5

Venue: Lecture Notes in Mathematics
Publisher: Springer Berlin Heidelberg
Published: 1993
ISSN: 0075-8434 (ISSN-L)
1617-9692
DOI: 10.1007/bfb0091534
OpenAlex: W2179025976
Cited by: 574
References: 0
FWCI: 23.20
Type: book
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