 A Polynomial Time Algorithm for Breaking the Basic MerkleHellman Cryptosystem, CRYPTO 1982, Shamir A. (1982)
 A Preliminary Report on the Cryptanalysis of MerkleHellman Knapsack Cryptosystems, CRYPTO 1982, Brickell E. and Davis A. and Simmons G. (1982)
 Knapsack Public Key Cryptosystems and Diophantine Approximation, CRYPTO 1983, Lagarias J. (1983)
 Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems, CRYPTO 1983, Brickell E. and Lagarias J. and Odlyzko A.(1983)
 Solving LowDensity Subset Sum Problems, FOCS 1983, Lagarias J. and Odlyzko A.(1983)
 Breaking Iterated Knapsacks, CRYPTO 1984, Brickell E. (1984)
 Performance Analysis of Shamir's Attack on the Basic MerkleHellman Knapsack Cryptosystem,
ICALP 1984, Lagarias J. (1984)
 An Improved LowDensity Subset Sum Algorithm, EUROCRYPT 1991, Coster J. and LaMacchia B. and Odlysko A. (1991)
 The cryptanalysis of a New Publickey Cryptosystem Based on Modular Knapsacks, Crypto 91, LNCS 576, Chee Y.M. and Joux A. and Stern J. (1991)
 Improving the Critical Density of the LagariasOdlyzko Attack against Subset Sum Problems,
Fundamentals of Computation Theory, LNCS 529, Joux A. and Stern J. (1991)
 Cryptanalysis of Another Knapsack Cryptosystem, Asiacrypt 91, LNCS 739, Joux A. and Stern J.
(1992)
 Improved Lowdensity Subset Sum Algorithms, Coster M. and Joux A. and LaMacchia B. and Odlyzko A. and Schnorr C.P. and Stern J. (1992)

Practical Attack against
Knapsack based Hash Functions, Joux A. and Granboulan L. (1994)
 Attacking the ChorRivest Cryptosystem by Improved Lattice Reduction, Schnorr C.P. and Hörner H.H. (1995)
 Breaking Knapsack Cryptosystems by MaxNorm Enumeration, Ritter H. (1996)
 MerkleHellman Revisited: a Cryptanalysis of the QuVanstone Cryptosystem Based on Group Factorizations, Nguyen P. and Stern J. (1997)
