A Primer on Pseudorandom Generators
2010
American Mathematical Society (Verlag)
9780821851920 (ISBN)
American Mathematical Society (Verlag)
9780821851920 (ISBN)
- Titel z.Zt. nicht lieferbar
- Versandkostenfrei
- Auch auf Rechnung
- Artikel merken
Surveys the theory of pseudorandomness, starting with the general paradigm, and discussing various incarnations while emphasizing the case of general-purpose pseudorandom generators. The primer assumes basic familiarity with the notion of efficient algorithms and with elementary probability theory, but provides a basic introduction to all notions that are actually used.
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 several natural notions of special-purpose pseudorandom generators. The primer assumes basic familiarity with the notion of efficient algorithms and with elementary probability theory, but provides a basic introduction to all notions that are actually used. As a result, the primer is essentially self-contained, although the interested reader is at times referred to other sources for more detail.
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 several natural notions of special-purpose pseudorandom generators. The primer assumes basic familiarity with the notion of efficient algorithms and with elementary probability theory, but provides a basic introduction to all notions that are actually used. As a result, the primer is essentially self-contained, although the interested reader is at times referred to other sources for more detail.
Introduction General-purpose pseudorandom generators Derandomization of time-complexity classes Space-bounded distinguishers Special purpose generators Concluding remarks Hashing functions On randomness extractors A generic hard-core predicate Using randomness in computation Cryptographic applications of pseudorandom functions Some basic vomplexity classes Bibliography Index
| Erscheint lt. Verlag | 22.3.2011 |
|---|---|
| Reihe/Serie | University Lecture Series |
| Zusatzinfo | Illustrations |
| Verlagsort | Providence |
| Sprache | englisch |
| Gewicht | 250 g |
| Themenwelt | Mathematik / Informatik ► Mathematik |
| ISBN-13 | 9780821851920 / 9780821851920 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Von Logik und Mengenlehre bis Zahlen, Algebra, Graphen und …
Buch | Softcover (2024)
De Gruyter Oldenbourg (Verlag)
CHF 104,90
Grundlagen für das Bachelor-Studium
Buch | Hardcover (2023)
Hanser (Verlag)
CHF 55,95
