A primer on pseudorandom generators

MaRDI QIDQ3585016zbMATH OpenFDO

Authors Oded Goldreich

Publication date 31 August 2010

zbMATH Keywords

complexity classespseudorandomnesspseudorandom generators

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Randomized algorithms (68W20) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 1670863
• scientific article; zbMATH DE number 861531
• The unified theory of pseudorandomness
• Pseudorandomness
• Hardness vs randomness

Cited in

(30)

• Paradigms for Unconditional Pseudorandom Generators
• Feedback linearly extended discrete functions
• Pseudorandom generators without the XOR lemma
• Pseudorandomness
• Some consequences of the existnce of pseudorandom generators
• Pairwise independence and derandomization.
• scientific article; zbMATH DE number 4141372 (Why is no real title available?)
• Improving the pseudo-randomness properties of chaotic maps using deep-zoom
• scientific article; zbMATH DE number 3876586 (Why is no real title available?)
• Thoughts on pseudorandom number generators
• Randomness -- a computational complexity perspective
• scientific article; zbMATH DE number 4182679 (Why is no real title available?)
• scientific article; zbMATH DE number 1670863 (Why is no real title available?)
• The unified theory of pseudorandomness
• Pseudorandom generators and the frequency of simplicity
• Security of Pseudo-random Generator and Monte Carlo Method
• scientific article; zbMATH DE number 9013 (Why is no real title available?)
• General pseudo-random generators from weaker models of computation
• Algorithm 947: Paraperm -- parallel generation of random permutations with MPI
• A note on Yao's theorem about pseudo-random generators
• A comparison of two approaches to pseudorandomness
• Multi-client oblivious RAM with poly-logarithmic communication
• Pseudorandom Generators and Typically-Correct Derandomization
• Pseudorandomness in computer science and in additive combinatorics
• Randomness buys depth for approximate counting
• scientific article; zbMATH DE number 4186980 (Why is no real title available?)
• A random-walk pseudorandom byte generator
• An asymptotically perfect pseudorandom generator
• Pseudorandom generators for space-bounded computation
• Pseudorandomness

This page was built for publication: A primer on pseudorandom generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585016)