The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Solving low-density subset sum problems
Open accessAbstract
The subset sum problem is to decide whether or not the 0-l integer programming problem Σ n i=l a i x i = M , ∀I , x I = 0 or 1, has a solution, where the a i and M are given positive integers. This problem is NP-complete, and the difficulty of solving it is the basis of public-key cryptosystems of knapsack type. An algorithm is proposed that searches for a solution when given an instance of the subset sum problem. This algorithm always halts in polynomial time but does not always find a solution when one exists. It converts the problem to one of finding a particular short vector v in a lattice, and then uses a lattice basis reduction algorithm due to A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovasz to attempt to find v. The performance of the proposed algorithm is analyzed. Let the density d of a subset sum problem be defined by d = n /log 2 (max i a i ). Then for “almost all” problems of density d < 0.645, the vector v we searched for is the shortest nonzero vector in the lattice. For “almost all” problems of density d < 1/ n , it is proved that the lattice basis reduction algorithm locates v. Extensive computational tests of the algorithm suggest that it works for densities d < d c ( n ), where d c ( n ) is a cutoff value that is substantially larger than 1/ n . This method gives a polynomial time attack on knapsack public-key cryptosystems that can be expected to break them if they transmit information at rates below d c ( n ), as n → ∞.
Overview
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
(1979) · Cited by 43,841
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
Hiding information and signatures in trapdoor knapsacks
Merkle, R., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055927 · Cited by 827
A Fortran Multiple-Precision Arithmetic Package
Brent, R. P. (1978) · ACM Transactions on Mathematical Software · doi:10.1145/355769.355775 · Cited by 216
A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem
Shamir, A. (1982) · doi:10.1109/sfcs.1982.55 · Cited by 103
Backtrack: An O(1) expected time algorithm for the graph coloring problem
Wilf, H. S. (1984) · Information Processing Letters · doi:10.1016/0020-0190(84)90013-9 · Cited by 91
Lempel, A. (1979) · ACM Computing Surveys · doi:10.1145/356789.356792 · Cited by 75
How to Calculate Shortest Vectors in a Lattice
Dieter, U. (1975) · Mathematics of Computation · doi:10.1090/s0025-5718-1975-0379386-6 · Cited by 73
Odlyzko, A. M. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056942 · Cited by 52
Self-citationKnapsack Public Key Cryptosystems and Diophantine Approximation
Lagarias, J. C. (1984) · Springer eBooks · doi:10.1007/978-1-4684-4730-9_1 · Cited by 49
Self-citation
Cited by
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
Schnorr, C. P., & Euchner, M. (1994) · Mathematical Programming · doi:10.1007/bf01581144 · Cited by 1,427
Generating hard instances of lattice problems (extended abstract)
Ajtai, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237838 · Cited by 1,405
Regev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
Gama, N., & Nguyen, P. Q. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_3 · Cited by 413
Semi-homomorphic Encryption and Multiparty Computation
Bendlin, R., Damgård, I., Orlandi, C., & Zakarias, S. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_11 · Cited by 354
Metadata
- Authors
- Lagarias, J. C., & Odlyzko, A. M.
- Venue
- Journal of the ACM
- Published
- 1985-01
- Volume
- 32
- Issue
- 1
- Pages
- 229-246
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2150780437
- Cited by
- 397
- References
- 11
- FWCI
- 7.22
- 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: Solving low-density subset sum problems. https://app.cochat.ai/papers/10.1145/2455.2461
- The paper
- Lagarias, J. C., & Odlyzko, A. M. (1985). Solving low-density subset sum problems. Journal of the ACM. https://doi.org/10.1145/2455.2461
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.