Artículos relacionados a Pseudorandomness and Cryptographic Applications (Princeton...

Pseudorandomness and Cryptographic Applications (Princeton Computer Science Notes): 1 - Tapa blanda

Luby, Michael

 
9780691025469: Pseudorandomness and Cryptographic Applications (Princeton Computer Science Notes): 1
Tapa blanda
ISBN 10: 0691025460 ISBN 13: 9780691025469
Editorial: Princeton University Press, 1996

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Acerca del autor

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.

De la contraportada

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Princeton University Press
Año de publicación
1996
Idioma
Inglés
ISBN 10 
0691025460
ISBN 13 
9780691025469
Encuadernación
Tapa blanda
Número de páginas
256
Contacto del fabricante
no disponible
Persona responsable
gpsr@libri.de
gpsr@libri.de

Europaallee 1
Bad Hersfeld
36244
Alemania