The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities
Open accessOverview
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 16,000
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1983) · Communications of the ACM · doi:10.1145/357980.358017 · Cited by 13,012
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Factoring polynomials with rational coefficients
Lenstra, A. K., Lenstra, H. W., & Lovász, L. (1982) · Mathematische Annalen · doi:10.1007/bf01457454 · Cited by 4,018
Bellare, M., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0053428 · Cited by 906
Solving Simultaneous Modular Equations of Low Degree
Hastad, J. (1988) · SIAM Journal on Computing · doi:10.1137/0217019 · Cited by 170
Low-Exponent RSA with Related Messages
Coppersmith, D., Franklin, M., Patarin, J., & Reiter, M. K. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9_1 · Cited by 130
Self-citationNP-Complete decision problems for binary quadratics
Manders, K. L., & Adleman, L. M. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90044-2 · Cited by 115
Protocol failures for RSA-like functions using Lucas sequences and elliptic curves
Jóye, M., & Quisquater, J.-J. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62494-5_8 · Cited by 7
Cited by
Remote timing attacks are practical
Brumley, D., & Boneh, D. (2005) · Computer Networks · doi:10.1016/j.comnet.2005.01.010 · Cited by 871
URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks
Luo, H., Kong, J., Zerfos, P., Lu, S., & Zhang, L. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.838598 · Cited by 294
Metadata
- Authors
- Coppersmith, D.
- Venue
- Journal of Cryptology
- Published
- 1997-09
- Volume
- 10
- Issue
- 4
- Pages
- 233-260
- ISSN
- 0933-2790 (ISSN-L)
- 1432-1378
- OpenAlex
- W2101040389
- Cited by
- 771
- References
- 10
- FWCI
- 30.96
- 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: Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. https://app.cochat.ai/papers/10.1007/s001459900030
- The paper
- Coppersmith, D. (1997). Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. Journal of Cryptology. https://doi.org/10.1007/s001459900030
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.
