On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem

We give a simple analysis of an algorithm for solving subset-sum problems proposed by Lagarias and Odlyzko [2].

[1]  Martin E. Hellman,et al.  Hiding information and signatures in trapdoor knapsacks , 1978, IEEE Trans. Inf. Theory.

[2]  Jeffrey C. Lagarias,et al.  Solving low density subset sum problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[3]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .