Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science, 671)

Micciancio, Daniele; Goldwasser, Shafi

ISBN 10: 0792376889 / ISBN 13: 9780792376880

Published by Springer, 2002

About this Item

A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.

Seller Inventory # OTV.0792376889.G

Bibliographic Details

• Title: Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science, 671)
• Publisher: Springer
• Publication Date: 2002
• Language: English
• ISBN 10: 0792376889
• ISBN 13: 9780792376880
• Binding: Hardcover
• Condition: good

About this title

Synopsis

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.