Placeholder text

Lattice Basis Reduction

Lattice Basis Reduction Computer Science

Lattice Basis Reduction

0 - Default Title
Description
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.
Product details
Edition:
illustrated
Number of Pages:
336
Release Date:
2011-09-08
Publication Date:
2011-08-12
Publisher:
CRC Press
Languages:
Original: English
ISBN10:
1439807027
ISBN13:
9781439807026
GPSR Manufacturer Reference:
Weight:
669 g
Height:
161 cm
Width:
240 cm
Thickness:
23 cm
Currently sold out