|
|
|
|
| LEADER |
03995nmm a2200397 u 4500 |
| 001 |
EB000623849 |
| 003 |
EBX01000000000000000476931 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9781461508977
|
| 100 |
1 |
|
|a Micciancio, Daniele
|
| 245 |
0 |
0 |
|a Complexity of Lattice Problems
|h Elektronische Ressource
|b A Cryptographic Perspective
|c by Daniele Micciancio, Shafi Goldwasser
|
| 250 |
|
|
|a 1st ed. 2002
|
| 260 |
|
|
|a New York, NY
|b Springer US
|c 2002, 2002
|
| 300 |
|
|
|a X, 220 p
|b online resource
|
| 505 |
0 |
|
|a 1 Basics -- 1 Lattices -- 2 Computational problems -- 3 Notes -- 2. Approximation Algorithms -- 1 Solving SVP in dimension -- 2 Approximating SVP in dimension n -- 3 Approximating CVP in dimension n -- 4 Notes -- 3. Closest Vector Problem -- 1 Decision versus Search -- 2 NP-completeness -- 3 SVP is not harder than CVP -- 4 Inapproximability of CVP -- 5 CVP with preprocessing -- 6 Notes -- 4. Shortest Vector Problem -- 1 Kannan’s homogenization technique -- 2 The Ajtai-Micciancio embedding -- 3 NP-hardnessofSVP -- 4 Notes -- 5. Sphere Packings -- 1 Packing Points in Small Spheres -- 2 The Exponential Sphere Packing -- 3 Integer Lattices -- 4 Deterministic construction -- 5 Notes -- 6. Low-Degree Hypergraphs -- 1 Sauer’s Lemma -- 2 Weak probabilistic construction -- 3 Strong probabilistic construction -- 4 Notes -- 7. Basis Reduction Problems -- 1 Successive minima and Minkowski’s reduction -- 2 Orthogonality defect and KZ reduction -- 3 Small rectangles and the covering radius -- 4 Notes -- 8. Cryptographic Functions -- 1 General techniques -- 2 Collision resistant hash functions -- 3 Encryption Functions -- 4 Notes -- 9. Interactive Proof Systems -- 1 Closest vector problem -- 2 Shortest vector problem -- 3 Treating other norms -- 4 What does it mean? -- 5 Notes -- References
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Electrical and Electronic Engineering
|
| 653 |
|
|
|a Electrical engineering
|
| 653 |
|
|
|a Data Structures and Information Theory
|
| 653 |
|
|
|a Information theory
|
| 653 |
|
|
|a Data structures (Computer science)
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Goldwasser, Shafi
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a The Springer International Series in Engineering and Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/978-1-4615-0897-7
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-1-4615-0897-7?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 003.54
|
| 082 |
0 |
|
|a 005.73
|
| 520 |
|
|
|a 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
|