The DOI matches its Crossref record; 32 of the 33 references it cites were found in a registry or an index.
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment
Open accessOverview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
A Course in Computational Algebraic Number Theory
Cohen, H. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-02945-9 · Cited by 2,567
The development of the number field sieve
(1993) · Lecture Notes in Mathematics · doi:10.1007/bfb0091534 · Cited by 574
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-citationSolving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
Coppersmith, D. (1994) · Mathematics of Computation · doi:10.2307/2153413 · Cited by 263
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
A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
Beckermann, B., & Labahn, G. (1994) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479892230031 · Cited by 184
Discrete logarithms and local units
Schirokauer, O. (1993) · Philosophical Transactions of the Royal Society of London Series A Physical and Engineering Sciences · doi:10.1098/rsta.1993.0139 · Cited by 165
Kaltofen, E. (1995) · Mathematics of Computation · doi:10.2307/2153451 · Cited by 132
Pollard, J. M. (1993) · Lecture notes in mathematics · doi:10.1007/bfb0091538 · Cited by 107
Joux, A., & Lercier, R. (2002) · Mathematics of Computation · doi:10.1090/s0025-5718-02-01482-5 · Cited by 93
Research works printed but not linked: 2
- Kleinjung, T.: Polynomial selection. Slides presented at the CADO workshop on integer factorization (2008). http://cado.gforge.inria.fr/workshop/abstracts.html
- Lenstra, A.K., Lenstra Jr., H.W. (eds.): The Development of the Number Field Sieve. LNM, vol. 1554. Springer, Heidelberg (1993). https://doi.org/10.1007/BFb0091534 · DOI · Paper page
Cited by
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
Quantum Algorithms: A Survey of Applications and End-to-end Complexities
Dalzell, A. M., McArdle, S., Berta, M., Bienias, P., Chen, C.-F., Gilyén, A., Hann, C. T., Kastoryano, M. J., Khabiboulline, E. T., Kubica, A., et al. (2023) · RWTH Publications (RWTH Aachen) · doi:10.18154/rwth-2026-02888 · Cited by 359
Experimental quantum secure network with digital signatures and encryption
Yin, H.-L., Fu, Y., Li, C.-L., Weng, C.-X., Li, B.-H., Gu, J., Lu, Y.-S., Huang, S., & Chen, Z.-B. (2023) · National Science Review · doi:10.1093/nsr/nwac228 · Cited by 214
Experimental authentication of quantum key distribution with post-quantum cryptography
Wang, L., Zhang, K., Wang, J., Cheng, J., Yang, Y., Tang, S.-B., Yan, D., Tang, Y.-L., Liu, Z., Yu, Y., et al. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00400-7 · Cited by 189
Quantum Algorithms: A Survey of Applications and End-to-end Complexities
Dalzell, A. M., McArdle, S., Berta, M., Bienias, P., Chen, C.-F., Gilyén, A., Hann, C. T., Kastoryano, M. J., Khabiboulline, E. T., Kubica, A., et al. (2025) · Cambridge University Press eBooks · doi:10.1017/9781009639651 · Cited by 146
Metadata
- Authors
- Boudot, F., Gaudry, P., Guillevic, A., Heninger, N., Thomé, E., & Zimmermann, P.
- Affiliations
- XLIM (FR)
- Centre National de la Recherche Scientifique (FR)
- University of California San Diego (US)
- Corresponding author
- Boudot, Fabrice
- Gaudry, Pierrick
- Guillevic, Aurore
- Heninger, Nadia
- Thomé, Emmanuel
- Zimmermann, Paul
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2020
- Volume
- 12171
- Pages
- 62-91
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W3034714558
- Cited by
- 71
- References
- 33
- Citations by year
- 2026: 5 · 2025: 9 · 2024: 15 · 2023: 17 · 2022: 9 · 2021: 10 · 2020: 6
- FWCI
- 7.96
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Lecture notes in computer science (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- HAL (submittedVersion, other-oa)
- arXiv (Cornell University)
- Funders
- National Science Foundation (1651344)
- Cisco Systems
- University of Pennsylvania
- European Commission
- Partnership for Advanced Computing in Europe AISBL
- Ministère de l'Enseignement Supérieur et de la Recherche
- Centre National de la Recherche Scientifique
- Conseil Régional de Lorraine
- Topics
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
- Physical Sciences › Mathematics › Algebra and Number Theory › Analytic Number Theory Research
- Keywords
- integer factorization, discrete logarithm problem, prime fields, computational cost comparison
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: Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. https://app.cochat.ai/papers/10.1007/978-3-030-56880-1_3
- The paper
- Boudot, F., Gaudry, P., Guillevic, A., Heninger, N., Thomé, E., & Zimmermann, P. (2020). Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-56880-1_3
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.