Skip to content

Pseudorandomness and Cryptographic Applications (Princeton Computer Science
Stock Photo: Cover May Be Different

Pseudorandomness and Cryptographic Applications (Princeton Computer Science Notes) Paperback - 1996

by Luby, Michael

  • Used
  • Paperback
Drop Ship Order

Description

Princeton University Press, 1996-01-08. paperback. Used: Good.
Used: Good
NZ$140.60
FREE Shipping to USA Standard delivery: 5 to 10 days
More Shipping Options
Ships from Ergodebooks (Texas, United States)

About Ergodebooks Texas, United States

Biblio member since 2005
Seller rating: This seller has earned a 3 of 5 Stars rating from Biblio customers.

Our goal is to provide best customer service and good condition books for the lowest possible price. We are always honest about condition of book. We list book only by ISBN # and hence exact book is guaranteed.

Terms of Sale:

We have 30 day return policy.

Browse books from Ergodebooks

Details

  • Title Pseudorandomness and Cryptographic Applications (Princeton Computer Science Notes)
  • Author Luby, Michael
  • Binding Paperback
  • Edition Text is Free of
  • Condition Used: Good
  • Pages 248
  • Volumes 1
  • Language ENG
  • Publisher Princeton University Press, Princeton, NJ
  • Date 1996-01-08
  • Bookseller's Inventory # SONG0691025460
  • ISBN 9780691025469 / 0691025460
  • Weight 0.85 lbs (0.39 kg)
  • Dimensions 9.2 x 6.08 x 0.7 in (23.37 x 15.44 x 1.78 cm)
  • Library of Congress subjects Data encryption (Computer science), Computational complexity
  • Library of Congress Catalog Number 96130688
  • Dewey Decimal Code 005.82

From the rear 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.

About the author

Michael Luby is the Leader of the Theory Group and a Research Scientist at the International Computer Science Institute in Berkeley, California. He is also an Adjunct Professor in the Computer Science Division at the University of California, Berkeley.