Articoli correlati a Complexity of Lattice Problems: A Cryptographic Perspective:...
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Contenuti
Preface. 1. Basics. 2. Approximation Algorithms. 3. Closest Vector Problem. 4. Shortest Vector Problem. 5. Sphere Packings. 6. Low-Degree Hypergraphs. 7. Basis Reduction Problems. 8. Cryptographic Functions. 9. Interactive Proof Systems. Index
Product Description
Book by Micciancio Daniele Goldwasser Shafi
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreKluwer Academic Pub
- Data di pubblicazione2002
- ISBN 10 0792376889
- ISBN 13 9780792376880
- RilegaturaCopertina rigida
- LinguaInglese
- Numero di pagine220
Compra nuovo
Visualizza questo articolo
EUR 254,23
EUR 6,19 per la spedizione in U.S.A.
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per Complexity of Lattice Problems: A Cryptographic Perspective:...
Foto dell'editore
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science, 671)
Da: BennettBooksLtd, North Las Vegas, NV, U.S.A.
Valutazione del venditore 5 su 5 stelle
hardcover. Condizione: New. In shrink wrap. Looks like an interesting title! Codice articolo Q-0792376889
Quantità: 1 disponibili
Foto dell'editore
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science, 671)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2416190184683
Quantità: Più di 20 disponibili
Foto dell'editore
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science, 671)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780792376880_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Complexity of Lattice Problems
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 5970350
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Complexity of Lattice Problems
Editore:
Springer US, Springer US Mär 2002, 2002
ISBN 10: 0792376889
ISBN 13: 9780792376880
Nuovo
Rilegato
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9780792376880
Quantità: 2 disponibili
Immagini fornite dal venditore
Complexity of Lattice Problems : A Cryptographic Perspective
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9780792376880
Quantità: 1 disponibili
Foto dell'editore
Complexity of Lattice Problems
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 236. Codice articolo 26317674
Quantità: 4 disponibili
Foto dell'editore
Complexity of Lattice Problems
Print on DemandDa: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Print on Demand pp. 236 Illus. Codice articolo 7563061
Quantità: 4 disponibili
Foto dell'editore
Complexity of Lattice Problems
Print on DemandDa: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. PRINT ON DEMAND pp. 236. Codice articolo 18317664
Quantità: 4 disponibili