Lattices are geometric objects that can be pictorially described as the set of intersection points of an infinite, regular n-dimensional grid. De� spite their apparent simplicity, lattices hide a rich combinatorial struc� ture, which has attracted the attention of great mathematicians over the last two centuries. Not surprisingly, lattices have found numerous ap� plications in mathematics and computer science, ranging from number theory and Diophantine approximation, to combinatorial optimization and cryptography. 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. The LLL algorithm, despite the relatively poor quality of the solution it gives in the worst case, allowed to devise polynomial time solutions to many classical problems in computer science. These include, solving integer programs in a fixed number of variables, factoring polynomials over the rationals, breaking knapsack based cryptosystems, and finding solutions to many other Diophantine and cryptanalysis problems.

Contenuti:

Preface. 1. Basics. 2. Approximation Algorithms. 3. Closest Vector Problem. 4. Shortest Vector Problem. 5. Sphere Packings. 6. Low-Degree Hypergraphs. 7. Basis Reduction Problems. 8. Cryptographic Functions. 9. Interactive Proof Systems. Index

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Descrizione libreria

Quality books, speedy shipping, and great customer service! Please note that used items may not include access codes or cards, CD's or other accessories, regardless of what is stated in item title. If you need to guarantee that these items are included, please purchase a brand new copy.

Visita la pagina della libreria

Informazioni sull?azienda del venditore

J2B Holdings, LLC
13770 NOEL RD, #803600, Dallas, TX, 75240, U.S.A.

Condizioni di vendita:

We guarantee the condition of every book as it's described on the AbeBooks web
sites. Please note that used items may not include access codes or cards, CD's
or other accessories, regardless of what is stated in item title. If you need to
guarantee that these items are included, please purchase a brand new copy.

All requests for refunds and/or returns will be processed in accordance with
AbeBooks policies. If you're dissatisfied with your purchase (Incorrect Book/Not
as Described/Damaged) or if ...

Ulteriori informazioni

Condizioni di spedizione:

Books ordered via expedited shipping should arrive between 2 and 7 business days after shipment confirmation. Books ordered via standard shipping should arrive between 4 and 14 business days after shipment confirmation.

Metodi di pagamento
accettati dalla libreria

Aggiungi ai desiderata

Articoli correlati a Complexity of Lattice Problems: A Cryptographic Perspective...

Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science)

Micciancio, Daniele; Goldwasser, Shafi

Nuovi - Brossura

Informazioni sull?azienda del venditore