Complexity Of Lattice Problems : a cryptographic perspective / Daniele Micciancio
Material type:
TextPublisher number: ;Zafaa Books & Distributors | :313/56F 49A, Anand Nagar Inderlok Delhi 110035Series: Kluwer international series in engineering and computer science, SECS 671Publication details: Boston : Kluwer Academic, ©2002.Description: x, 220p. 25 cmISBN: - 9781461352938
- 512.7 MIC
| Item type | Current library | Call number | Status | Notes | Barcode | |
|---|---|---|---|---|---|---|
Books
|
SNU LIBRARY | 512.7 MIC (Browse shelf(Opens below)) | Not For Loan | Books Shifted to Mathematics Dept. | 28599 |
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.
"Complexity of Lattice Problems: A Cryptographic Perspective is an essential reference for those researching ways in which lattice problems can be used to build cryptographic systems. It will also be of interest to those working in computational complexity, combinatorics, and foundations of cryptography."--Jacket.
There are no comments on this title.