Tell your friends about this item:
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
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | October 29, 2012 |
| ISBN13 | 9781461352938 |
| Publishers | Springer-Verlag New York Inc. |
| Pages | 220 |
| Dimensions | 155 × 235 × 12 mm · 367 g |
| Language | English |
More by Daniele Micciancio
Show allMere med samme udgiver
See all of Daniele Micciancio ( e.g. Paperback Book )