Complexity of Lattice Problems: A Cryptographic Perspective and over one million other books are available for Amazon Kindle. Learn more


or
Sign in to turn on 1-Click ordering.
or
Amazon Prime Free Trial required. Sign up when you check out. Learn More
Sell Back Your Copy
For a $5.25 Gift Card
Trade in
More Buying Choices
Have one to sell? Sell yours here
Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science)
 
 
Start reading Complexity of Lattice Problems: A Cryptographic Perspective on your Kindle in under a minute.

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science) [Hardcover]

Daniele Micciancio (Author), Shafi Goldwasser (Author)

List Price: $206.00
Price: $163.51 & this item ships for FREE with Super Saver Shipping. Details
You Save: $42.49 (21%)
  Special Offers Available
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.
Only 1 left in stock--order soon (more on the way).
Want it delivered Tuesday, January 31? Choose One-Day Shipping at checkout. Details
Textbook Student FREE Two-Day Shipping for Students. Learn more

Formats

Amazon Price New from Used from
Kindle Edition $127.20  
Hardcover $163.51  
Sell Back Your Copy for $5.25
Whether you buy it used on Amazon for $163.48 or somewhere else, you can sell it back through our Book Trade-In Program at the current price of $5.25.
Used Price$163.48
Trade-in Price$5.25
Price after
Trade-in
$158.23

Book Description

0792376889 978-0792376880 March 31, 2002 1st
The book presents a self-contained overview of the state of the art in the complexity of lattice problems, with particular emphasis on problems that are related to the construction of cryptographic functions. Specific topics covered are the strongest known inapproximability result for the shortest vector problem; the relations between this and other computational lattice problems; an exposition of how cryptographic functions can be built and prove secure based on worst-case hardness assumptions about lattice problems; and a study of the limits of non-approximability of lattice problems. Some background in complexity theory, but no prior knowledge about lattices, is assumed.

Special Offers and Product Promotions

  • Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)

Frequently Bought Together

Customers buy this book with The LLL Algorithm: Survey and Applications (Information Security and Cryptography) $102.77

Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science) + The LLL Algorithm: Survey and Applications (Information Security and Cryptography)
Price For Both: $266.28

Show availability and shipping details

  • This item: Complexity of Lattice Problems: A Cryptographic Perspective (The Springer International Series in Engineering and Computer Science)

    In Stock.
    Ships from and sold by Amazon.com.
    This item ships for FREE with Super Saver Shipping. Details

  • The LLL Algorithm: Survey and Applications (Information Security and Cryptography)

    In Stock.
    Ships from and sold by Amazon.com.
    This item ships for FREE with Super Saver Shipping. Details


Customers Who Bought This Item Also Bought


Product Details


More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews


There are no customer reviews yet.
Video reviews
Video reviews
Amazon now allows customers to upload product video reviews. Use a webcam or video camera to record and upload reviews to Amazon.



Inside This Book (learn more)
First Sentence:
This book is about algorithmic problems on point lattices, and their computational complexity. Read the first page
Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
nearest plane algorithm, other lattice problems, reduction from subset sum, closest vector problem, covering radius problem, approximating cvp, transference theorems, nonzero lattice vector, orthogonalized vectors, independent lattice vectors, orthogonality defect, shortest nonzero vector, shortest vector problem, lattice point close, distinct lattice points, subset sum instances, decisional version, packing radius, subset sum problem, statistical distance, many lattice points, randomized reductions, swap step, shortest lattice vector, basis reduction algorithm
Key Phrases - Capitalized Phrases (CAPs): (learn more)
Emde Boas, Set Cover
New!
Books on Related Topics | Concordance | Text Stats
Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Search Inside This Book:




Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product).
 

Your tags: Add your first tag
 

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   
Related forums


Listmania!


Create a Listmania! list

So You'd Like to...


Create a guide


Look for Similar Items by Category


Look for Similar Items by Subject