Complexity Of Lattice Problems

Author: Daniele Micciancio
Editor: Springer Science & Business Media
ISBN: 1461508975
File Size: 25,37 MB
Format: PDF, ePub
Read: 5785
Download

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.
Complexity of Lattice Problems
Language: en
Pages: 220
Authors: Daniele Micciancio, Shafi Goldwasser
Categories: Computers
Type: BOOK - Published: 2012-12-06 - Publisher: Springer Science & Business Media

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
Computational Complexity of Lattice Problems
Language: en
Pages: 46
Authors: Mårten Larsson
Categories: Computers
Type: BOOK - Published: 1999 - Publisher:

Books about Computational Complexity of Lattice Problems
Cryptography and Lattices
Language: en
Pages: 224
Authors: Joseph H. Silverman
Categories: Computers
Type: BOOK - Published: 2003-06-30 - Publisher: Springer

This book constitutes the thoroughly refereed post-proceedings of the International Conference on Cryptography and Lattices, CaLC 2001, held in Providence, RI, USA in March 2001. The 14 revised full papers presented together with an overview paper were carefully reviewed and selected for inclusion in the book. All current aspects of
STACS 2004
Language: en
Pages: 658
Authors: Springer-verlag
Categories: Computers
Type: BOOK - Published: 2004-03-18 - Publisher: Springer Science & Business Media

This book constitutes the refereed proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, STACS 2004, held in Montpellier, France, in March 2004. The 54 revised full papers presented together with two invited contributions were carefully reviewed and selected from more than 200 submissions. The papers are
Security of Information and Networks
Language: en
Pages: 369
Authors: Atilla Elçi, S. Berna Ors, Bart Preneel
Categories: Computers
Type: BOOK - Published: 2008-01 - Publisher: Trafford Publishing

Security of Information and Networks includes invited and contributed papers on information assurance, security, and public policy. It covers Ciphers, Mobile Agents, Access Control, Security Assurance, Intrusion Detection, and Security Software.