A primer on pseudorandom generators / Oded Goldreich.

Show other versions (1)

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...

Full description

Bibliographic Details
Uniform Title:University lecture series (Providence, R.I.) ; 55.
Main Author: Goldreich, Oded
Language:English
Published: Providence, R.I. : American Mathematical Society, [2010], ©2010.
Series:University lecture series (Providence, R.I.) ; 55.
Subjects:
Computational complexity.
Random number generators.
Computer science > Mathematics.
Datavetenskap.
Physical Description:x, 114 pages : illustrations ; 26 cm.
Format: Book
Contents:
  • Chapter 1. Introduction
  • Chapter 2. General-purpose pseudorandom generators
  • Chapter 3. Derandomization of time-complexity classes
  • Chapter 4. Space-bounded distinguishers
  • Chapter 5. Special purpose generators
  • Concluding remarks
  • Appendix A. Hashing functions
  • Appendix B. On randomness extractors
  • Appendix C. A generic hard-core predicate
  • Appendix D. Using randomness in computation
  • Appendix E. Cryptographic applications of pseudorandom functions
  • Appendix F. Some basic complexity classes.