Items related to A Primer on Pseudorandom Generators

A Primer on Pseudorandom Generators - Softcover

Oded Goldreich

 
9780821851920: A Primer on Pseudorandom Generators

Synopsis

A fresh look at the question of randomness was taken in the theory of computing: A distribution is pseudorandom if it cannot be distinguished from the uniform distribution by any efficient procedure. This paradigm, originally associating efficient procedures with polynomial-time algorithms, has been applied with respect to a variety of natural classes of distinguishing procedures. The resulting theory of pseudorandomness is relevant to science at large and is closely related to central areas of computer science, such as algorithmic design, complexity theory, and cryptography. This primer surveys the theory of pseudorandomness, starting with the general paradigm, and discussing various incarnations while emphasizing the case of general-purpose pseudorandom generators (withstanding any polynomial-time distinguisher). Additional topics include the "derandomization" of arbitrary probabilistic polynomial-time algorithms, pseudorandom generators withstanding space-bounded distinguishers, and

"synopsis" may belong to another edition of this title.

Review

"This book provides basic information about pseudorandom generators, one of the topics with the strongest impact in recent years, not only because of the subject itself but also because of its many applications in all fields of science." ---- Luis Hernandez Encinas, Mathematical Reviews

"About this title" may belong to another edition of this title.