Pseudorandomness and Cryptographic Applications
Michael Luby
des. 2019 · Princeton University Press
Rafbók
248
Síður
family_home
Gjaldgeng
info
reportEinkunnir og umsagnir eru ekki staðfestar Nánar
Um þessa rafbók
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.
Um höfundinn
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.
Gefa þessari rafbók einkunn.
Segðu okkur hvað þér finnst.
Upplýsingar um lestur
Snjallsímar og spjaldtölvur
Settu upp forritið Google Play Books fyrir Android og iPad/iPhone. Það samstillist sjálfkrafa við reikninginn þinn og gerir þér kleift að lesa með eða án nettengingar hvar sem þú ert.
Fartölvur og tölvur
Hægt er að hlusta á hljóðbækur sem keyptar eru í Google Play í vafranum í tölvunni.
Lesbretti og önnur tæki
Til að lesa af lesbrettum eins og Kobo-lesbrettum þarftu að hlaða niður skrá og flytja hana yfir í tækið þitt. Fylgdu nákvæmum leiðbeiningum hjálparmiðstöðvar til að flytja skrár yfir í studd lesbretti.
