Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.

Pseudorandomness and Cryptographic Applications (Princeton Computer Science Notes)

4.0 out of 5 stars 1 customer review
ISBN-13: 978-0691025469
ISBN-10: 0691025460
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Have one to sell? Sell on Amazon
Buy used On clicking this link, a new layer will be open
$20.62 On clicking this link, a new layer will be open
Buy new On clicking this link, a new layer will be open
$87.00 On clicking this link, a new layer will be open
More Buying Choices
28 New from $49.98 25 Used from $20.62
Free Two-Day Shipping for College Students with Prime Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Windows10ForDummiesVideo
Windows 10 For Dummies Video Training
Get up to speed with Windows 10 with this video training course from For Dummies. Learn more.
$87.00 FREE Shipping. In Stock. Ships from and sold by Amazon.com. Gift-wrap available.
click to open popover

Editorial Reviews

Amazon.com Review

Pseudorandomness and Cryptographic Applications, by Michael Luby, presents the mathematical underpinnings of one-way hash functions, which can be used to implement pseudorandom number generators. (These have a wide array of applications in cryptography.) After covering these basic mathematical ideas, the author delves into their applications in cryptosystems. Organized in 18 lectures, this book provides a mathematically intense treatise on the subject without much commentary in between. A set of exercises accompanies each chapter and a bibliography concludes the text. Filled with elegant mathematics, this is clearly a book for academic specialists.

From the Back Cover

A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs.
NO_CONTENT_IN_FEATURE

The latest book club pick from Oprah
"The Underground Railroad" by Colson Whitehead is a magnificent novel chronicling a young slave's adventures as she makes a desperate bid for freedom in the antebellum South. See more

Product Details

  • Series: Princeton Computer Science Notes
  • Paperback: 248 pages
  • Publisher: Princeton University Press (January 8, 1996)
  • Language: English
  • ISBN-10: 0691025460
  • ISBN-13: 978-0691025469
  • Product Dimensions: 6 x 0.6 x 9 inches
  • Shipping Weight: 13.6 ounces (View shipping rates and policies)
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #3,455,570 in Books (See Top 100 in Books)

Customer Reviews

5 star
0%
4 star
100%
3 star
0%
2 star
0%
1 star
0%
See the customer review
Share your thoughts with other customers

Top Customer Reviews

By Dr. Lee D. Carlson HALL OF FAMEVINE VOICE on March 25, 2001
Format: Paperback
Walking into a colleague's office and noticing papers scattered all over her desk and shelves, I remarked on the apparent disorganization. She explained that from her standpoint everything was organized and easy to find. Randomness, she said, is observer dependent.
This is the theme taken in this book, namely tha a proper concept of randomness is not an intrinsic property of a collection or a distribution, but rather is dependent of the tools and computing capabilities of the observer. The concept of a pseudorandom distribution is introduced as a distribution where no efficient procedure or program can distinguish it from a uniform distribution. Pseudorandom generators are polynomial-time deterministic programs that take a randomly selected seed and expand it into a pseudorandom bit sequence.
The preliminaries/introduction gives an overview of sets, set functions, big-O, little-o notation, and most importantly from the author's standpoint, function and probability ensembles. He defines what it means to have a source of random bits, but does not give algorithms on how to produce them. Complexity classes are also discussed for both the deterministic and probabilistic cases, along with a very brief review of probability.
Private key cryptosystems begin the next chapter with an example of a one-time-pad private key cryptosystems. Pseudorandom generators are introduced as a solution to the problem of sending secure messages that are longer than the private key.
The author does a good job of defining computational and statistical indistinguishability, and the connection between 1-way functions and pseudorandom generators.
Read more ›
Comment 8 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Set up an Amazon Giveaway

Pseudorandomness and Cryptographic Applications (Princeton Computer Science Notes)
Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more about Amazon Giveaway
This item: Pseudorandomness and Cryptographic Applications (Princeton Computer Science Notes)