The DOI matches its Crossref record.
Approximate Integer Common Divisors
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
Cited by
Fully Homomorphic Encryption over the Integers
van Dijk, M., Gentry, C., Halevi, S., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_2 · Cited by 1,858
TFHE: Fast Fully Homomorphic Encryption Over the Torus
Chillotti, I., Gama, N., Georgieva, M., & Izabachène, M. (2020) · Journal of Cryptology · doi:10.1007/s00145-019-09319-x · Cited by 990
Batch Fully Homomorphic Encryption over the Integers
Cheon, J. H., Coron, J.-S., Kim, J., Lee, M. S., Lepoint, T., Tibouchi, M., & Yun, A. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-38348-9_20 · Cited by 352
The Two Faces of Lattices in Cryptology
Nguyen, P. Q., & Stern, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44670-2_12 · Cited by 252
Federated learning‐based trajectory prediction model with privacy preserving for intelligent vehicle
Han, M., Xu, K., Ma, S., Li, A., & Jiang, H. (2022) · International Journal of Intelligent Systems · doi:10.1002/int.22987 · Cited by 37
“FAHE1 homomorphic encryption is based on the approximate common divisor problem 30 as well as uses simpler and faster operations that bring better efficiency in encryption, decryption, and homomorphic addition of ciphertexts.”
Method
Metadata
- Authors
- Howgrave-Graham, N.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2001
- Pages
- 51-66
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2144862055
- Cited by
- 219
- References
- 0
- FWCI
- 1.79
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Approximate Integer Common Divisors. https://app.cochat.ai/papers/10.1007/3-540-44670-2_6
- The paper
- Howgrave-Graham, N. (2001). Approximate Integer Common Divisors. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-44670-2_6
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.