Lattice Basis Reduction
An Introduction to the LLL Algorithm and Its Applications
1st Edition
Published on 12. August 2011
332 pages
978-1-4398-0704-0 (ISBN)
Description
First developed in the early 1980s by Lenstra, Lenstra, and Lovasz, 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 for use in cryptanalysis. This book provides an introduction to the theory and applications of lattice basis reduction and the LLL algorithm. With numerous examples and suggested exercises, the text discusses various applications of lattice basis reduction to cryptography, number theory, polynomial factorization, and matrix canonical forms.
Reviews / Votes
the book succeeds in making accessible to nonspecialists the area of lattice algorithms, which is remarkable because some of the most important results in the field are fairly recent.-M. Zimand, Computing Reviews, March 2012
This text is meant as a survey of lattice basis reduction at a level suitable for students and interested researchers with a solid background in undergraduate linear algebra. ... The writing is clear and quite concise.
-Zentralblatt MATH 1237
More details
Series
Language
English
Place of publication
Baton Rouge
United States
Publishing group
Taylor & Francis Inc
Target group
Professional and scholarly
Students and researchers in mathematics and computer science.
Illustrations
54 s/w Abbildungen
54 b/w images and 5 in text boxes
File size
2,29 MB
ISBN-13
978-1-4398-0704-0 (9781439807040)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Book
10/2024
1st Edition
CRC Press
€94.27
Shipment within 10-20 days
Book
08/2011
1st Edition
CRC Press
€171.60
Shipment within 15-20 days
Person
Murray R. Bremner received a Bachelor of Science from the University of Saskatchewan in 1981, a Master of Computer Science from Concordia University in Montreal in 1984, and a Doctorate in Mathematics from Yale University in 1989. He spent one year as a Postdoctoral Fellow at the Mathematical Sciences Research Institute in Berkeley, and three years as an Assistant Professor in the Department of Mathematics at the University of Toronto. He returned to the Department of Mathematics and Statistics at the University of Saskatchewan in 1993 and was promoted to Professor in 2002. His research interests focus on the application of computational methods to problems in the theory of linear nonassociative algebras, and he has had more than 50 papers published or accepted by refereed journals in this area.
Content
Introduction to Lattices. Two-Dimensional Lattices. Gram-Schmidt Orthogonalization. The LLL Algorithm. Deep Insertions. Linearly Dependent Vectors. The Knapsack Problem. Coppersmith's Algorithm. Diophantine Approximation. The Fincke-Pohst Algorithm. Kannan's Algorithm. Schnorr's Algorithm. NP-Completeness. The Hermite Normal Form. Polynomial Factorization.
