Lattice basis reduction: Improved practical algorithms and solving subset sum problems

This publication has 14 references indexed in Scilit:

• An Improved Low-Density Subset Sum Algorithm
  Published by Springer Nature ,2001
• Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems
  Published by Springer Nature ,1991
• The rise and fall of knapsack cryptosystems
  Published by American Mathematical Society (AMS) ,1991
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
  SIAM Journal on Computing, 1989
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
  IEEE Transactions on Information Theory, 1988
• Minkowski's Convex Body Theorem and Integer Programming
  Mathematics of Operations Research, 1987
• 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
• Solving Low Density Knapsacks
  Published by Springer Nature ,1984
• Factoring polynomials with rational coefficients
  Mathematische Annalen, 1982