Lattice basis reduction : an introduction to the LLL algorithm and its applications /

First developed in the early 1980s by Lenstra, Lenstra, and Lovász, the LLL algorithm was originally used to provide a polynomial-time algorithm for factoring polynomials with rational coefficients. It very quickly became an essential tool in integer linear programming problems and was later adapted...

Full description

Bibliographic Details
Main Author: Bremner, Murray R. (Author)
Corporate Author: Taylor & Francis
Format: eBook
Language:English
Language Notes:English.
Published: Boca Raton, Fla. : CRC Press, 2012.
Edition:1st edition.
Series:Pure and applied mathematics.
Monographs and textbooks in pure and applied mathematics.
Subjects:
Online Access:Connect to the full text of this electronic book
Table of Contents:
  • Front Cover; Contents; List of Figures; Preface; About the Author; 1. Introduction to Lattices; 2. Two-Dimensional Lattices; 3. Gram-Schmidt Orthogonalization; 4. The LLL Algorithm; 5. Deep Insertions; 6. Linearly Dependent Vectors; 7. The Knapsack Problem; 8. Coppersmith's Algorithm; 9. Diophantine Approximation; 10. The Fincke-Pohst Algorithm; 11. Kannan's Algorithm; 12. Schnorr's Algorithm; 13. NP-Completeness; 14. The Hermite Normal Form; 15. Polynomial Factorization; Bibliography