Complexity of Lattice Problems: A Cryptographic Perspective
Daniele Micciancio, Shafi Goldwasser
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.
种类:
年:
2012
出版:
Softcover reprint of the original 1st ed. 2002
出版社:
Springer
语言:
english
页:
230
ISBN 10:
1461352932
ISBN 13:
9781461352938
系列:
The Springer International Series in Engineering and Computer Science
文件:
PDF, 6.97 MB
IPFS:
,
english, 2012