Improved low-density subset sum algorithms
- 1 June 1992
- journal article
- Published by Springer Nature in computational complexity
- Vol. 2 (2) , 111-128
- https://doi.org/10.1007/bf01201999
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- An Improved Low-Density Subset Sum AlgorithmPublished by Springer Nature ,2001
- Improving the critical density of the Lagarias-Odlyzko attack against subset sum problemsPublished by Springer Nature ,1991
- Lattice basis reduction: Improved practical algorithms and solving subset sum problemsPublished by Springer Nature ,1991
- A knapsack-type public key cryptosystem based on arithmetic in finite fieldsIEEE Transactions on Information Theory, 1988
- Cryptanalysis: a survey of recent resultsProceedings of the IEEE, 1988
- What Happened with Knapsack Cryptographic Schemes?Published by Springer Nature ,1988
- Approximating integer lattices by lattices with cyclic factor groupsPublished by Springer Nature ,1987
- On the Lagarias-Odlyzko Algorithm for the Subset Sum ProblemSIAM Journal on Computing, 1986
- Solving low-density subset sum problemsJournal of the ACM, 1985
- Solving Low Density KnapsacksPublished by Springer Nature ,1984