Recomienda este artículo a tus amigos:
Complexity of Lattice Problems: A Cryptographic Perspective - The Springer International Series in Engineering and Computer Science Daniele Micciancio Softcover reprint of the original 1st ed. 2002 edition
Complexity of Lattice Problems: A Cryptographic Perspective - The Springer International Series in Engineering and Computer Science
Daniele Micciancio
The study of lattices, specifically from a computational point of view, was marked by two major breakthroughs: the development of the LLL lattice reduction algorithm by Lenstra, Lenstra and Lovasz in the early 80's, and Ajtai's discovery of a connection between the worst-case and average-case hardness of certain lattice problems in the late 90's.
220 pages, biography
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 29 de octubre de 2012 |
| ISBN13 | 9781461352938 |
| Editores | Springer-Verlag New York Inc. |
| Páginas | 220 |
| Dimensiones | 155 × 235 × 12 mm · 367 g |
| Lengua | Inglés |
Mas por Daniele Micciancio
Mostrar todoMere med samme udgiver
Ver todo de Daniele Micciancio ( Ej. Paperback Book )