Spara
Complexity of Lattice Problems
Författare:
häftad, 2012
Engelska
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.
- Undertitel
- A Cryptographic Perspective
- Författare
- Daniele Micciancio, Shafi Goldwasser
- Upplaga
- Softcover reprint of the original 1st ed. 2002
- ISBN
- 9781461352938
- Språk
- Engelska
- Vikt
- 310 gram
- Utgivningsdatum
- 2012-10-29
- Sidor
- 220
