Bibliography

1

E. F. Brickell, Solving low density knapsacks. Advances in Cryptology, Proceedings of Crypto '83, Plenum Press, New York (1984), 25-37.

2

E. F. Brickell, The cryptanalysis of knapsack cryptosystems. Applications of Discrete Mathematics, R. D. Ringeisen and F. S. Roberts, eds., SIAM (1988), 3-23.

3

E. F. Brickell and A. M. Odlyzko, Cryptanalysis: a survey of recent results, Proc. IEEE 76 (1988), 578-593.

4

B. Chor and R. Rivest, A knapsack-type public key cryptosystem based on arithmetic in finite fields, IEEE Trans. Information Theory IT-34 (1988), 901-909.

5

Y. Desmedt, What happened with knapsack cryptographic schemes?, Performance Limits in Communication, Theory and Practice, J. K. Skwirzynski, ed., Kluwer (1988), 113-134.

6

P. van Emde Boas, Another NP-complete partition problem and the complexity of computing short vectors in a lattice, Rept. 81-04, Dept. of Mathematics, Univ. of Amsterdam, 1981.

7

A. M. Frieze, On the Lagarias-Odlyzko algorithm for the subset sum problem, SIAM J. Comput. 15(2) (May 1986), 536-539.

8

M. L. Furst and R. Kannan, Succinct certificates for almost all subset sum problems, SIAM J. Comput. 18 (1989), 550-558.

9

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company (1979).

10

J. Hastad, B. Just, J. C. Lagarias, and C. P. Schnorr, Polynomial time algorithms for finding integer relations among real numbers, SIAM J. Comput. 18(5) (October 1989), 859-881.

11

A. Joux and J. Stern, Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems, Proceedings of Fundamentals of Computation Theory '91, to be published.

12

J. C. Lagarias and A. M. Odlyzko, Solving low-density subset sum problems, J. Assoc. Comp. Mach. 32(1) (January 1985), 229-246.

13

B. A. LaMacchia, Basis Reduction Algorithms and Subset Sum Problems, SM Thesis, Dept. of Elect. Eng. and Comp. Sci., Massachusetts Institute of Technology, Cambridge, MA (1991).

14

A. K. Lenstra, H. W. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515-534.

15

J. E. Mazo and A. M. Odlyzko, Lattice points in high-dimensional spheres, Monatsh. Math. 110 (1990), 47-61.

16

A. M. Odlyzko, The rise and fall of knapsack cryptosystems, Cryptology and Computational Number Theory, C. Pomerance, ed., Am. Math. Soc., Proc. Symp. Appl. Math. 42 (1990), 75-88.

17

A. Paz and C. P. Schnorr, Approximating integer lattices by lattices with cyclic factor groups, Automata, Languages, and Programming: $14^{\text{th}}$ ICALP, Lecture Notes in Computer Science 267, Springer-Verlag, NY (1987), 386-393.

18

S. Radziszowski and D. Kreher, Solving subset sum problems with the L³ algorithm, J. Combin. Math. Combin. Comput. 3 (1988), 49-63.

19

C. P. Schnorr, A hierarchy of polynomial time lattice basis reduction algorithms, Theoretical Computer Science 53 (1987), 201-224.

20

C. P. Schnorr, A more efficient algorithm for lattice basis reduction, J. Algorithms 9 (1988), 47-62.

21

C. P. Schnorr and M. Euchner, Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems, Proceedings of Fundamentals of Computation Theory '91, to be published.

22

M. Seysen, Simultaneous reduction of a lattice basis and its reciprocal basis, Combinatorica, to appear.