Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science)

Micciancio, Daniele; Goldwasser, Shafi

ISBN 10: 1461352932 / ISBN 13: 9781461352938

Published by Springer, 2012

Seller Inventory # I-9781461352938

Synopsis:

Lattices are geometric objects that can be pictorially described as the set of intersection points of an infinite, regular n-dimensional grid. De­ spite their apparent simplicity, lattices hide a rich combinatorial struc­ ture, which has attracted the attention of great mathematicians over the last two centuries. Not surprisingly, lattices have found numerous ap­ plications in mathematics and computer science, ranging from number theory and Diophantine approximation, to combinatorial optimization and cryptography. The study of lattices, specifically from a computational point of view, was marked by two major breakthroughs: the development of the LLL lattice reduction algorithm by Lenstra, Lenstra and Lovasz in the early 80's, and Ajtai's discovery of a connection between the worst-case and average-case hardness of certain lattice problems in the late 90's. The LLL algorithm, despite the relatively poor quality of the solution it gives in the worst case, allowed to devise polynomial time solutions to many classical problems in computer science. These include, solving integer programs in a fixed number of variables, factoring polynomials over the rationals, breaking knapsack based cryptosystems, and finding solutions to many other Diophantine and cryptanalysis problems.

Product Description: 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.

Bibliographic Details

Title: Complexity of Lattice Problems: A ...
Publisher: Springer
Publication Date: 2012
Binding: Soft cover
Condition: New