Articles liés à Complexity of Lattice Problems: A Cryptographic Perspective
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 223,97
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Complexity of Lattice Problems: A Cryptographic Perspective
Image fournie par le vendeur
Complexity of Lattice Problems
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Gebunden. Etat : New. N° de réf. du vendeur 5970350
Quantité disponible : Plus de 20 disponibles
Image d'archives
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science, 671)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780792376880_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Complexity of Lattice Problems : A Cryptographic Perspective
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 757194-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Complexity of Lattice Problems : A Cryptographic Perspective
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 757194-n
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Complexity of Lattice Problems
Edité par
Springer US, Springer US Mär 2002, 2002
ISBN 10 : 0792376889
ISBN 13 : 9780792376880
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9780792376880
Quantité disponible : 2 disponible(s)
Image d'archives
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science, 671)
Vendeur : BennettBooksLtd, North Las Vegas, NV, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
hardcover. Etat : New. In shrink wrap. Looks like an interesting title! N° de réf. du vendeur Q-0792376889
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Complexity of Lattice Problems
Edité par
Springer US, Springer US Mär 2002, 2002
ISBN 10 : 0792376889
ISBN 13 : 9780792376880
Neuf
Couverture rigide
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9780792376880
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Complexity of Lattice Problems : A Cryptographic Perspective
Edité par
Springer US, Springer US, 2002
ISBN 10 : 0792376889
ISBN 13 : 9780792376880
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9780792376880
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Complexity of Lattice Problems : A Cryptographic Perspective
Edité par
Springer, 2002
ISBN 10 : 0792376889
ISBN 13 : 9780792376880
Ancien ou d'occasion
Couverture rigide
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 757194
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Complexity of Lattice Problems : A Cryptographic Perspective
Edité par
Springer, 2002
ISBN 10 : 0792376889
ISBN 13 : 9780792376880
Ancien ou d'occasion
Couverture rigide
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 757194
Quantité disponible : Plus de 20 disponibles