你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Complexity of Lattice Problems: A Cryptographic Perspective
Type
Physical Book
Author
Publisher
Language
English
Pages
220
Format
Paperback
Dimensions
23.4x15.6x1.3 cm
Weight
0.34 kg.
ISBN13
9781461352938
Categories

Complexity of Lattice Problems: A Cryptographic Perspective

Daniele Micciancio (Author) · Shafi Goldwasser (Author) · Springer · Paperback

Complexity of Lattice Problems: A Cryptographic Perspective - Micciancio, Daniele ; Goldwasser, Shafi

Cheaper New Book Imported to Taiwan
Delivery: 03 Dec - 16 Dec Shipping: 14 to 18 business days.
NT$ 8,982
Faster New Book Imported to Taiwan
Delivery: 20 Nov - 30 Nov Shipping: 5 to 6 business days.
NT$ 10,137
NT$ 8,982

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Complexity of Lattice Problems: A Cryptographic Perspective"

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews