Solving low-density subset sum problems
- 1 January 1985
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 32 (1), 229-246
- https://doi.org/10.1145/2455.2461
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Computational Complexity of Simultaneous Diophantine Approximation ProblemsSIAM Journal on Computing, 1985
- Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature schemeIEEE Transactions on Information Theory, 1984
- Embedding cryptographic trapdoors in arbitrary knapsack systemsInformation Processing Letters, 1983
- On the complexity of finding short vectors in integer latticesLecture Notes in Computer Science, 1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Minkowskische Reduktionsbedingungen für positiv definite quadratische Formen in 5 VariablenMonatshefte für Mathematik, 1982
- Cryptology in TransitionACM Computing Surveys, 1979
- Hiding information and signatures in trapdoor knapsacksIEEE Transactions on Information Theory, 1978
- A Fortran Multiple-Precision Arithmetic PackageACM Transactions on Mathematical Software, 1978
- How to calculate shortest vectors in a latticeMathematics of Computation, 1975