The LLL Algorithm

Survey and Applications

By Phong Q. Nguyen , Brigitte Vallée

The LLL Algorithm Cover Image

The first book to offer a comprehensive view of the LLL algorithm, this text surveys computational aspects of Euclidean lattices and their main applications. It includes many detailed motivations, explanations and examples.

Full Description

  • ISBN13: 978-3-6420-2294-4
  • 512 Pages
  • User Level: Science
  • Publication Date: December 2, 2009
  • Available eBook Formats: PDF
  • eBook Price: $159.00
Buy eBook Buy Print Book Add to Wishlist
Full Description
The LLL algorithm is a polynomial-time lattice reduction algorithm, named after its inventors, Arjen Lenstra, Hendrik Lenstra and László Lovász. The algorithm has revolutionized computational aspects of the geometry of numbers since its introduction in 1982, leading to breakthroughs in fields as diverse as computer algebra, cryptology and algorithmic number theory. This book consists of 15 survey chapters on computational aspects of Euclidean lattices and their main applications. Topics covered include polynomial factorization, lattice reduction algorithms, applications in number theory, integer programming, provable security, lattice-based cryptography and complexity. The authors include many detailed motivations, explanations and examples, and the contributions are largely self-contained. The book will be of value to a wide range of researchers and graduate students working in related fields of theoretical computer science and mathematics.
Table of Contents

Table of Contents

  1. A Tale of Two Papers.
  2. Polynomial Factorization and Lattices in the Very Early 1980s.
  3. Floating
  4. Point LLL: Theoretical and Practical Aspects.
  5. Progress on LLL and Lattice Reduction.
  6. Probabilistic Analyses of Lattice Reduction Algorithms.
  7. LLL: A Tool for Effective Diophantine Approximation.
  8. Selected Applications of LLL in Number Theory.
  9. The van Hoeij Algorithm to Factor Polynomials.
  10. The LLL
  11. Algorithm and Integer Programming.
  12. The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance.
  13. Practical Lattice
  14. Based Cryptography: NTRUEncrypt and NTRUSign.
  15. Using LLL
  16. Reduction for Solving RSA and Factorization Problems: A Survey.
  17. Lattice
  18. Based Cryptanalysis.
  19. Inapproximability Results for Computational Problems on Lattices.
  20. On the Complexity of Lattice Problems with Polynomial Approximation Factors.
  21. Cryptographic Functions from Worst
  22. Case Complexity Assumptions.

If you think that you've found an error in this book, please let us know about it. You will find any confirmed erratum below, so you can check if your concern has already been addressed.

* Required Fields

No errata are currently published