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...
| Main Author: | |
|---|---|
| Corporate Author: | |
| 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 |
| Summary: | 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. |
|---|---|
| Item Description: | A Chapman and Hall book. |
| Physical Description: | 1 online resource (330 pages). |
| Bibliography: | Includes bibliographical references and index. |
| ISBN: | 0429130457 9780429130458 9786613311504 6613311502 1439807043 9781439807040 |