Pseudorandomness and Cryptographic Applications
Michael Luby
Dis 2019 · Princeton University Press
I-Ebook
248
Amakhasi
family_home
Kufanelekile
info
reportIzilinganiso nezibuyekezo aziqinisekisiwe Funda Kabanzi
Mayelana nale ebook
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.
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.
Mayelana nomlobi
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.
Nikeza le ebook isilinganiso
Sitshele ukuthi ucabangani.
Ulwazi lokufunda
Amasmathifoni namathebulethi
Faka uhlelo lokusebenza lwe-Google Play Amabhuku lwe-Android ne-iPad/iPhone. Livunyelaniswa ngokuzenzakalela ne-akhawunti yakho liphinde likuvumele ukuthi ufunde uxhunywe ku-inthanethi noma ungaxhunyiwe noma ngabe ukuphi.
Amakhompyutha aphathekayo namakhompyutha
Ungalalela ama-audiobook athengwe ku-Google Play usebenzisa isiphequluli sewebhu sekhompuyutha yakho.
Ama-eReaders namanye amadivayisi
Ukuze ufunde kumadivayisi e-e-ink afana ne-Kobo eReaders, uzodinga ukudawuniloda ifayela futhi ulidlulisele kudivayisi yakho. Landela imiyalelo Yesikhungo Sosizo eningiliziwe ukuze udlulise amafayela kuma-eReader asekelwayo.
