Advertisement

Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems

  • Antoine Joux
  • Jacques Stern
Commanications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 529)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    A. M. Frieze. On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem. Siam J. Comp (1986) vol. 15, no. 2, 536–539.Google Scholar
  2. [2]
    J. C. Lagarias and A. M. Odlyzko. Solving low-density subset sum problems. Proceedings of IEEE symposium on the foundations of Computer Science. (1983) 1–10.Google Scholar
  3. [3]
    A. K. Lenstra, H. W. Lenstra and L. Lovàsz. Factoring polynomials with rational coefficients. Math. Annalen 261 (1982) 515–534.Google Scholar
  4. [4]
    J. E. Mazo and A. M. Odlyzko. Lattice Points in High-dimensional Spheres. AT&T Technical Memorandum Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Antoine Joux
  • Jacques Stern

There are no affiliations available

Personalised recommendations