Complexity of Lattice Problems: A Cryptographic Perspective is anessential reference for those researching ways in which lattice problems canbe used to build cryptographic systems. It will also be of interest to thoseworking in computational complexity, combinatorics, and foundations ofcryptography.
The book presents a self-contained overview of the state of the art in thecomplexity of lattice problems, with particular emphasis on problems that arerelated to the construction of cryptographic functions. Specific topicscovered are the strongest known inapproximability result for the shortestvector problem; the relations between this and other computational latticeproblems; an exposition of how cryptographic functions can be built andproven secure based on worst-case hardness assumptions about latticeproblems; and a study of the limits of non-approximability of latticeproblems. Some background in complexity theory, but no prior knowledge aboutlattices, is assumed.
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in En
Download File: https://cavenymyoku.blogspot.com/?lp=2vCX6D
2ff7e9595c
Commentaires