An Improved Low-Density Subset Sum Algorithm

This publication has 15 references indexed in Scilit:

• The rise and fall of knapsack cryptosystems
  Published by American Mathematical Society (AMS) ,1991
• Lattice points in high-dimensional spheres
  Monatshefte für Mathematik, 1990
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
  SIAM Journal on Computing, 1989
• Succinct Certificates for Almost All Subset Sum Problems
  SIAM Journal on Computing, 1989
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
  IEEE Transactions on Information Theory, 1988
• Cryptanalysis: a survey of recent results
  Proceedings of the IEEE, 1988
• What Happened with Knapsack Cryptographic Schemes?
  Published by Springer Nature ,1988
• On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
  SIAM Journal on Computing, 1986
• Solving low-density subset sum problems
  Journal of the ACM, 1985
• Factoring polynomials with rational coefficients
  Mathematische Annalen, 1982