Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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 access

Overview

Integrity signals

Registry

Crossref · 10.1007/978-3-030-56880-1_3

Cites

32 of 32 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 33 references

Research works printed but not linked: 2

  1. Kleinjung, T.: Polynomial selection. Slides presented at the CADO workshop on integer factorization (2008). http://cado.gforge.inria.fr/workshop/abstracts.html
  2. 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

See all 112

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
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
Licence
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.