You might also like

More about Complexity of Lattice Problems

• Book details
• Synopsis
• Trending among others

You get 638 loyalty points

Book synopsis

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

Book category Books in English Computing & information technology Computer security Data encryption

• Full title: Complexity of Lattice Problems
• Subtitle: A Cryptographic Perspective
• Author: Daniele Micciancio, Shafi Goldwasser
• Language: English
• Binding: Hardback
• Number of pages: 220
• EAN: 9780792376880
• ISBN: 0792376889
• ID: 01397201
• Publisher: Springer, Berlin
• Weight: 513 g
• Dimensions: 235 × 155 × 14 mm
• Published: 2002

Trending among others

---

---

---