Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem

  • Conference paper
  • First Online:
Cryptography and Lattices (CaLC 2001)

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

Included in the following conference series:

Abstract

We present an overview of a randomized 2g(n) time algorithm to compute a shortest non-zero vector in an n-dimensional rational lattice. The complete details of this algorithm can be found in [2].

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Ajtai. The shortest vector problem in L 2 is NP-hard for randomized reductions. Proc. 30th ACM Symposium on Theory of Computing, pp. 10–19, 1998.

    Google Scholar 

  2. M. Ajtai, R. Kumar, and D. Sivakumar. A sieve algorithm for the shortest lattice vector problem. Proc. 33rd ACM Symposium on Theory of Computing, 2001. To appear.

    Google Scholar 

  3. P. van Emde Boas. Another NP-complete partition problem and the complexity of computing short vectors in lattices. Mathematics Department, University of Amsterdam, TR 81-04, 1981.

    Google Scholar 

  4. C. F. Gauss. Disquisitiones Arithmeticae. English edition, (Translated by A. A. Clarke) Springer-Verlag, 1966.

    Google Scholar 

  5. O. Goldreich and S. Goldwasser. On the limits of nonapproximability of lattice problems. Journal of Computer and System Sciences, 60(3):540–563, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  6. B. Helfrich. Algorithms to construct Minkowski reduced and Hermite reduced bases. Theoretical Computer Science, 41:125–139, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  7. C. Hermite. Second letter to Jacobi, Oeuvres, I, Journal für Mathematik, 40:122–135, 1905.

    Google Scholar 

  8. R. Kannan. Minkowski’s convex body theorem and integer programming. Mathematics of Operations Research, 12:415–440, 1987. Preliminary version in ACM Symposium on Theory of Computing 1983.

    Article  MATH  MathSciNet  Google Scholar 

  9. R. Kumar and D. Sivakumar. On polynomial approximations to the shortest lattice vector length. Proc. 12th Symposium on Discrete Algorithms, 2001.

    Google Scholar 

  10. A. K. Lenstra, H. W. Lenstra, and L. Lovász. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515–534, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. C. Lagarias, H. W. Lenstra, and C. P. Schnorr. Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal lattice. Combinatorica, 10:333–348, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  12. D. Micciancio. The shortest vector in a lattice is hard to approximate to within some constant. Proc. 39th IEEE Symposium on Foundations of Computer Science, pp. 92–98, 1998.

    Google Scholar 

  13. H. Minkowski. Geometrie der Zahlen. Leipzig, Teubner, 1990.

    Google Scholar 

  14. C. P. Schnorr. A hierarchy of polynomial time basis reduction algorithms. Theoretical Computer Science, 53:201–224, 1987.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Almaden Research Center, 650 Harry Road, San Jose, CA, 95120

    Miklós Ajtai, Ravi Kumar & Dandapani Sivakumar

Authors
  1. Miklós Ajtai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ravi Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dandapani Sivakumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematics Department, Brown University, Box 1917, Providence, RI, 02912, USA

    Joseph H. Silverman

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ajtai, M., Kumar, R., Sivakumar, D. (2001). An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem. In: Silverman, J.H. (eds) Cryptography and Lattices. CaLC 2001. Lecture Notes in Computer Science, vol 2146. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44670-2_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-44670-2_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42488-8

  • Online ISBN: 978-3-540-44670-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation