Improved low-density subset sum algorithms

Factoring polynomials with rational coefficients

A. K. Lenstra, H. W. Lenstra, László Lovász · Mathematische Annalen · 1982 · 4K citations · Full text

Natural Sciences, Mathematics, Algebra +4

A hierarchy of polynomial time lattice basis reduction algorithms

C. P. Schnorr · Theoretical Computer Science · 1987 · 643 citations · Full text

Computing, Computer Science, Mathematics +9

Solving low-density subset sum problems

Jeffrey C. Lagarias, Andrew Odlyzko · Journal of the ACM · 1985 · 406 citations · Full text

Computing, Computer Science, Mathematics +17

A knapsack-type public key cryptosystem based on arithmetic in finite fields

Benny Chor, Ronald L. Rivest · IEEE Transactions on Information Theory · 1988 · 241 citations

Computing, Computer Engineering, Computer Science +8

Cryptanalysis: a survey of recent results

Ernest F. Brickell, Andrew Odlyzko · Proceedings of the IEEE · 1988 · 135 citations

Computing, Computer Engineering, Computer Science +12