Complexity of Lattice Problems
Daniele Micciancio · 2002
Where to buy
Amazon’s price changes daily, so the most accurate place to see it is there, at the moment you buy.
View on AmazonThis is an affiliate link: if you buy through it, the site earns a small commission at no extra cost to you, which helps us bring quality content and maintain the site. As an Amazon Associate we earn from qualifying purchases.
About the book
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.
Book details
- Year
- 2002
- Language
- English
- Series
- The Springer International Series in Engineering and Computer Science -- 671
- Publisher
- Springer US
- Editions
- 3
- Pages
- 220
- ISBN
- 9781461352938
Data source: Wikidata
More by Daniele Micciancio
