0
Your cart

Your cart is empty

Books > Professional & Technical > Energy technology & engineering > Electrical engineering

Buy Now

Complexity of Lattice Problems - A Cryptographic Perspective (Paperback, Softcover reprint of the original 1st ed. 2002) Loot Price: R6,503
Discovery Miles 65 030
Complexity of Lattice Problems - A Cryptographic Perspective (Paperback, Softcover reprint of the original 1st ed. 2002):...

Complexity of Lattice Problems - A Cryptographic Perspective (Paperback, Softcover reprint of the original 1st ed. 2002)

Daniele Micciancio, Shafi Goldwasser

Series: The Springer International Series in Engineering and Computer Science, 671

 (sign in to rate)
Loot Price R6,503 Discovery Miles 65 030 | Repayment Terms: R609 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

Donate to Gift Of The Givers

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."

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: The Springer International Series in Engineering and Computer Science, 671
Release date: October 2012
First published: 2002
Authors: Daniele Micciancio • Shafi Goldwasser
Dimensions: 235 x 155 x 12mm (L x W x T)
Format: Paperback
Pages: 220
Edition: Softcover reprint of the original 1st ed. 2002
ISBN-13: 978-1-4613-5293-8
Categories: Books > Science & Mathematics > Mathematics > General
Books > Computing & IT > General theory of computing > Data structures
Books > Computing & IT > Computer programming > Algorithms & procedures
Books > Computing & IT > Applications of computing > General
Books > Professional & Technical > Energy technology & engineering > Electrical engineering > General
LSN: 1-4613-5293-2
Barcode: 9781461352938

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners