Recomienda este artículo a tus amigos:
Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications - Chapman & Hall Pure and Applied Mathematics Bremner, Murray R. (University of Saskatchewan, Saskatoon, Canada) 1.º edición
Pedido desde almacén remoto
Nuestros clientes opinan:
Lattice Basis Reduction: An Introduction to the LLL Algorithm and Its Applications - Chapman & Hall Pure and Applied Mathematics
Bremner, Murray R. (University of Saskatchewan, Saskatoon, Canada)
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.
332 pages, 54 black & white illustrations
| Medios de comunicación | Libros Hardcover Book (Libro con lomo y cubierta duros) |
| Publicado | 12 de agosto de 2011 |
| ISBN13 | 9781439807026 |
| Editores | Taylor & Francis Inc |
| Páginas | 332 |
| Dimensiones | 231 × 156 × 24 mm · 472 g |
| Lengua | Inglés |
