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.
- ÉditeurSpringer
- Date d'édition2012
- ISBN 10 1461352932
- ISBN 13 9781461352938
- ReliureBroché
- Langueanglais
- Nombre de pages236
Acheter neuf
Afficher cet article
EUR 225,79
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
Etat : New. N° de réf. du vendeur 4193527
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)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9781461352938_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Complexity of Lattice Problems
Edité par
Springer US, Springer US Okt 2012, 2012
ISBN 10 : 1461352932
ISBN 13 : 9781461352938
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. 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. 236 pp. Englisch. N° de réf. du vendeur 9781461352938
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Complexity of Lattice Problems : A Cryptographic Perspective
Edité par
Springer US, Springer New York, 2012
ISBN 10 : 1461352932
ISBN 13 : 9781461352938
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. 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 9781461352938
Quantité disponible : 1 disponible(s)
Image d'archives
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar2716030032038
Quantité disponible : Plus de 20 disponibles
Image d'archives
Complexity of Lattice Problems
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Print on Demand pp. 236 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. N° de réf. du vendeur 51007316
Quantité disponible : 4 disponible(s)
Image d'archives
Complexity of Lattice Problems
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur 1858585217
Quantité disponible : 4 disponible(s)