Description du livre Etat : New. New! This book is in the same immaculate condition as when it was published. N� de r�f. du vendeur 353-1461352932-new

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 256,50

Autre devise

Ajouter au panier

Frais de port : Gratuit

Vers Etats-Unis

Destinations, frais et d�lais

Image d'archives

Complexity of Lattice Problems : A Cryptographic Perspective

Daniele Micciancio

Edit� par Springer (2012)

ISBN 10 : 1461352932 ISBN 13 : 9781461352938

Neuf Couverture souple Quantit� disponible : > 20

impression � la demande

Vendeur :

Ria Christie Collections
(Uxbridge, Royaume-Uni)

Evaluation vendeur

Evaluation du vendeur :

Description du livre Etat : New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. N� de r�f. du vendeur ria9781461352938_lsuk

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 252,08

Autre devise

Ajouter au panier

Frais de port : EUR 11,69

De Royaume-Uni vers Etats-Unis

Destinations, frais et d�lais

Image fournie par le vendeur

Complexity of Lattice Problems

Shafi Goldwasser

Edit� par Springer US Okt 2012 (2012)

ISBN 10 : 1461352932 ISBN 13 : 9781461352938

Neuf Taschenbuch Quantit� disponible : 2

impression � la demande

Vendeur :

BuchWeltWeit Ludwig Meier e.K.
(Bergisch Gladbach, Allemagne)

Evaluation vendeur

Evaluation du vendeur :

Description du livre 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

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 246,09

Autre devise

Ajouter au panier

Frais de port : EUR 23

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Image fournie par le vendeur

Complexity of Lattice Problems : A Cryptographic Perspective

Shafi Goldwasser

Edit� par Springer US (2012)

ISBN 10 : 1461352932 ISBN 13 : 9781461352938

Neuf Taschenbuch Quantit� disponible : 1

Vendeur :

AHA-BUCH GmbH
(Einbeck, Allemagne)

Evaluation vendeur

Evaluation du vendeur :

Description du livre 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

Plus d'informations sur ce vendeur | Contacter le vendeur

Acheter neuf

EUR 249,04

Autre devise

Ajouter au panier

Frais de port : EUR 32,99

De Allemagne vers Etats-Unis

Destinations, frais et d�lais

Articles li�s � Complexity of Lattice Problems: A Cryptographic Perspective

Complexity of Lattice Problems: A Cryptographic Perspective - Couverture souple

Micciancio, Daniele; Goldwasser, Shafi

Acheter neuf

Autres �ditions populaires du m�me titre

Edition pr�sent�e

Meilleurs r�sultats de recherche sur AbeBooks