Lattice Basis Reduction : An Introduction to the LLL Algorithm and Its Applications
Book Details
Delivery Location
Delivery fee: Select location
Delivery in 28 days
First realized in the 1980s by Lenstra, Lenstra, and Lovasz, the LLL algorithm was originally intended to factor polynomials with rational coefficients. It improved upon the existing lattice reduction algorithm in order to solve integer linear programming problems and was later adapted for use in crypanalysis. 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 polynomial factorization, cryptography, number theory, and matrix canonical forms.
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.
Get Lattice Basis Reduction by at the best price and quality guaranteed only at Werezi Africa's largest book ecommerce store. The book was published by Taylor & Francis Inc and it has pages.