Skip to main content

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

  • Commanications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 529))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. A. K. Lenstra, H. W. Lenstra and L. Lovàsz. Factoring polynomials with rational coefficients. Math. Annalen 261 (1982) 515–534.

    Google Scholar 

  4. J. E. Mazo and A. M. Odlyzko. Lattice Points in High-dimensional Spheres. AT&T Technical Memorandum

    Google Scholar 

Download references

Authors

Editor information

L. Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Joux, A., Stern, J. (1991). Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1991. Lecture Notes in Computer Science, vol 529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54458-5_70

Download citation

  • DOI: https://doi.org/10.1007/3-540-54458-5_70

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54458-6

  • Online ISBN: 978-3-540-38391-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics