AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
A Primer on Pseudorandom Generators
About this Title
Oded Goldreich, Weizmann Institute of Science, Rehovot, Israel
Publication: University Lecture Series
Publication Year:
2010; Volume 55
ISBNs: 978-0-8218-5192-0 (print); 978-1-4704-1650-8 (online)
DOI: https://doi.org/10.1090/ulect/055
MathSciNet review: MR2677397
MSC: Primary 68-02; Secondary 68Q15, 68Q17, 68Q87, 68W20
Table of Contents
Download chapters as PDF
Front/Back Matter
Chapters
- 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