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) - Softcover
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
The 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.
Buy New
View this item
£ 204.13
£ 11.98 shipping from United Kingdom to U.S.A.
Destination, rates & speedsOther Popular Editions of the Same Title
Search results for Complexity of Lattice Problems: A Cryptographic Perspective:...
Stock Image
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9781461352938_new
Quantity: Over 20 available
Stock Image
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science)
Seller: Best Price, Torrance, CA, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9781461352938
Quantity: 2 available
Stock Image
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar2716030032038
Quantity: Over 20 available
Seller Image
Complexity of Lattice Problems
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 4193527
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 # 19494298-n
Quantity: 15 available
Stock Image
Complexity of Lattice Problems (Paperback)
Published by
Springer-Verlag New York Inc., New York, NY, 2012
ISBN 10: 1461352932
ISBN 13: 9781461352938
New
Paperback
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781461352938
Quantity: 1 available
Seller Image
Complexity of Lattice Problems
Published by
Springer US, Springer US Okt 2012, 2012
ISBN 10: 1461352932
ISBN 13: 9781461352938
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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. 236 pp. Englisch. Seller Inventory # 9781461352938
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 # 19494298
Quantity: 15 available
Seller Image
Complexity of Lattice Problems
Published by
Springer US, Springer New York Okt 2012, 2012
ISBN 10: 1461352932
ISBN 13: 9781461352938
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. 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 236 pp. Englisch. Seller Inventory # 9781461352938
Quantity: 2 available
Stock Image
Complexity of Lattice Problems
Published by
Springer-Verlag New York Inc., 2012
ISBN 10: 1461352932
ISBN 13: 9781461352938
New
Softcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. Series: The Springer International Series in Engineering and Computer Science. Num Pages: 220 pages, biography. BIC Classification: MB; PBH; UY. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 12. Weight in Grams: 367. . 2012. Softcover reprint of the original 1st ed. 2002. Paperback. . . . . Seller Inventory # V9781461352938
Quantity: 15 available