Items related to Complexity of Lattice Problems: A Cryptographic Perspective:...
Complexity of Lattice Problems: A Cryptographic Perspective: 671 (The Springer International Series in Engineering and Computer Science, 671) - Hardcover
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.
"synopsis" may belong to another edition of this title.
Product Description
Complexity of Lattice Problems Presents an overview of the complexity of lattice problems, with particular emphasis on problems that are related to the construction of cryptographic functions. This book includes topics that cover inapproximability result for the shortest vector problem; the relations between this and other computational lattice problems; and, more.
Synopsis
This 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.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Complexity of Lattice Problems: A Cryptographic Perspective:...
Seller Image
Complexity of Lattice Problems : A Cryptographic Perspective
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 757194-n
Quantity: Over 20 available
Stock Image
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science, 671)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780792376880_new
Quantity: Over 20 available
Seller Image
Complexity of Lattice Problems
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Gebunden. Condition: New. Seller Inventory # 5970350
Quantity: Over 20 available
Seller Image
Complexity of Lattice Problems : A Cryptographic Perspective
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 757194-n
Quantity: Over 20 available
Seller Image
Complexity of Lattice Problems : A Cryptographic Perspective
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 757194
Quantity: Over 20 available
Stock Image
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science, 671)
Seller: BennettBooksLtd, North Las Vegas, NV, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0792376889
Quantity: 1 available
Seller Image
Complexity of Lattice Problems
Published by
Springer US, Springer US Mär 2002, 2002
ISBN 10: 0792376889
ISBN 13: 9780792376880
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 234 pp. Englisch. Seller Inventory # 9780792376880
Quantity: 2 available
Seller Image
Complexity of Lattice Problems : A Cryptographic Perspective
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 757194
Quantity: Over 20 available
Seller Image
Complexity of Lattice Problems : A Cryptographic Perspective
Published by
Springer US, Springer US, 2002
ISBN 10: 0792376889
ISBN 13: 9780792376880
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9780792376880
Quantity: 1 available
Seller Image
Complexity of Lattice Problems
Published by
Springer US, Springer US Mär 2002, 2002
ISBN 10: 0792376889
ISBN 13: 9780792376880
New
Hardcover
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 234 pp. Englisch. Seller Inventory # 9780792376880
Quantity: 2 available