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 adapte...
| Autor principal: | |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Boca Raton, FL :
CRC Press
c2012.
|
| Edición: | 1st edition |
| Colección: | Pure and applied mathematics.
Monographs and textbooks in pure and applied mathematics. |
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009628289406719 |
| Sumario: | 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 |
|---|---|
| Notas: | A Chapman & Hall book. |
| Descripción Física: | 1 online resource (330 p.) |
| Bibliografía: | Includes bibliographical references and index. |
| ISBN: | 9780429130458 9781283311502 9786613311504 9781439807040 |
