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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 529 LNCS, Issue , 1991, Pages 68-85

  Schnorr, C P ^a   Euchner, M ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BIT LENGTHS; EMPIRICAL TEST; LATTICE BASIS REDUCTION; RANDOM WEIGHT; SUBSET SUM PROBLEMS;

COMPUTATION THEORY;

EID: 85029774337     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54458-5_51     Document Type: Conference Paper

References (21)

1. E.F. BRICKELL: Solving low density knapsacks. Advances in Crypto logy, Proceedings of CRYPTO’83, Plenum Press, New Yjork (1984), 25-37.
2. 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.
3. M.J. COSTER, B.A. LAMACCHIA, A.M. ODLYZKO and CP. SCHNORR: An improved low-density subset sum algorithm. Proceedings EURO-CRYPT’ 91, Brighton, May 1991, to appear in Springer LNCS.
4. 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.
5. M. EUCHNER: Praktische Algorithmen zur Gitterreduktion und Fak-torisierung. Diplomarbeit Uni. Frankfurt (1991).
6. A. M. FRIEZE: On the Lagarias-Odlyzko algorithm for the subset sum problem. SIAM J. Comput. 15 (2) (1986), 536-539.
7. M. R. GAREY and D. S. JOHNSON: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company (1979).
8. 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.
9. A. Joux and J. STERN: Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems. Proceedings of FCT symposium, Brandenburg, Germany, September (1991).
10. R. KANNAN: Minkowski’s Convex Body Theory and Integer Programming. Math. Oper. Res. 12 (1987), 415-440.
11. J.C. LAGARIAS, H.W. LENSTRA, JR. and CP. SCHNORR: Korkine-Zolotarev Bases and Successive Minima of a Lattice and its Reciprocal Lattice. To appear in Combinatorica.
12. J. C LAGARIAS and A. M. ODLYZKO: Solving low-density subset sum problems. J. Assoc. Comp. Mach. 32(1) (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 Technoliogy, Cambridge, MA (1991). In preparation.
14. A.K. LENSTRA, H.W. LENSTRA, and L. LOVÁSZ: Factoring polynomials with rational coefficients. Math. Ann. 261 (1982), 515-534.
15. 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.
16. A. PAZ and C. P. SCHNORR: Approximating integer lattices by lattices with cyclic factor groups. Automata, Languages, and Programming: 14th ICALP, Lecture Notes in Computer Science 267, Springer-Verlag, NY (1987), 386-393.
17. 3 algorithm. J. Combin. Math. Combin. Comput. 3 (1988), 49-63.
18. C. P. SCHNORR: A hierarchy of polynomial time lattice basis reduction algorithms. Theoretical Computer Science 53 (1987), 201-224.
19. C. P. SCHNORR: A more efficient algorithm for lattice basis reduction. J. Algorithms 9 (1988), 47-62.
20. C. P. SCHNORR: Factoring integers and computing discrete logarithms via diophantine approximation. Proceedings EUROCRYPT’91, Brighton, May 1991, to appear in Springer LNCS.
21. M. SEYSEN: Simultaneous reduction of a lattice basis and its reciprocal basis. To appear in Combinatorica.