Normal view MARC view ISBD view

Micciancio, Daniele

Complexity Of Lattice Problems : a cryptographic perspective / Daniele Micciancio - Boston : Kluwer Academic, ©2002. - x, 220p. 25 cm. - Kluwer international series in engineering and computer science, SECS 671. .

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.

ISBN: 9781461352938

Publisher. No.: Zafaa Books & Distributors :313/56F 49A, Anand Nagar Inderlok Delhi 110035

Subjects--Topical Terms:
Mathematics
Algebra
Computational complexity.
Coding theory.
Lattice theory.
Codage.
Théorie des treillis.

Dewey Class. No.: 512.7 MIC