图书标签: 数学 计算机科学 端模式 efeef Math
发表于2024-11-22
Complexity of Lattice Problems pdf epub mobi txt 电子书 下载 2024
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.
评分
评分
评分
评分
Complexity of Lattice Problems pdf epub mobi txt 电子书 下载 2024