Complexity of lattice problems : a cryptographic perspective
著者
書誌事項
Complexity of lattice problems : a cryptographic perspective
（The Kluwer international series in engineering and computer science）
Springer, c2002
大学図書館所蔵 件 / 全5件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical reference (p. [211]-216) and index
内容説明・目次
内容説明
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.
目次
Preface. 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. Index
「Nielsen BookData」 より
