Complexity of Lattice Problems
A Cryptographic Perspective
Häftad, Engelska, 2012
3 479 kr
Beställningsvara. Skickas inom 7-10 vardagar
Fri frakt för medlemmar vid köp för minst 249 kr.Finns i fler format (1)
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.
Produktinformation
- Utgivningsdatum2012-10-29
- Mått155 x 235 x 13 mm
- Vikt365 g
- SpråkEngelska
- SerieSpringer International Series in Engineering and Computer Science
- Antal sidor220
- FörlagSpringer-Verlag New York Inc.
- EAN9781461352938