Zobacz książki o podobnej tematyce

Więcej informacji o Complexity of Lattice Problems

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 685 punkty

Opis

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.

Szczegóły książki

Kategoria Książki po angielsku Computing & information technology Computer security Data encryption

• Pełny tytuł: Complexity of Lattice Problems
• Podtytuł: A Cryptographic Perspective
• Autor: Daniele Micciancio, Shafi Goldwasser
• Język: Angielski
• Oprawa: Twarda
• Liczba stron: 220
• EAN: 9780792376880
• ISBN: 0792376889
• ID: 01397201
• Wydawca: Springer, Berlin
• Waga: 513 g
• Wymiary: 235 × 155 × 14 mm
• Rok wydania: 2002

Ulubione w innej kategorii

---

---

---