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 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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!