Siirry suoraan sisältöön
Complexity of Lattice Problems
Tallenna

Complexity of Lattice Problems

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.
Alaotsikko
A Cryptographic Perspective
Painos
Softcover reprint of the original 1st ed. 2002
ISBN
9781461352938
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
29.10.2012
Sivumäärä
220