| Pseudorandomness &Amp; Cryptographic Applications Contributor(s): Luby, Michael (Author) |
|
 |
ISBN: 0691025460 ISBN-13: 9780691025469 Publisher: Princeton University Press OUR PRICE: $94.95 Product Type: Paperback Published: January 1996 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Computers | Security - Cryptography - Mathematics | Applied |
| Dewey: 005.82 |
| LCCN: 96130688 |
| Series: Princeton Computer Science Notes |
| Physical Information: 0.7" H x 6.08" W x 9.2" (0.85 lbs) 248 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |