Complexity of Lattice Problems: A Cryptographic Perspective / Edition 1

Complexity of Lattice Problems: A Cryptographic Perspective / Edition 1

by Daniele Micciancio, Shafi Goldwasser
     
 

ISBN-10: 0792376889

ISBN-13: 9780792376880

Pub. Date: 03/31/2002

Publisher: Springer US

The book presents a self-contained overview of the state of the art in the complexity of lattice problems, with particular emphasis on problems that are related to the construction of cryptographic functions. Specific topics covered are the strongest known inapproximability result for the shortest vector problem; the relations between this and other computational

Overview

The book presents a self-contained overview of the state of the art in the complexity of lattice problems, with particular emphasis on problems that are related to the construction of cryptographic functions. Specific topics covered are the strongest known inapproximability result for the shortest vector problem; the relations between this and other computational lattice problems; an exposition of how cryptographic functions can be built and prove secure based on worst-case hardness assumptions about lattice problems; and a study of the limits of non-approximability of lattice problems. Some background in complexity theory, but no prior knowledge about lattices, is assumed.

Product Details

ISBN-13:
9780792376880
Publisher:
Springer US
Publication date:
03/31/2002
Series:
The Springer International Series in Engineering and Computer Science, #671
Edition description:
2002
Pages:
220
Product dimensions:
9.21(w) x 6.14(h) x 0.63(d)

Table of Contents

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

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >