A primer on pseudorandom generators

zbMATH Open1210.68061MaRDI QIDQ3585016FDOQ3585016

Authors: Oded Goldreich 

Publication date: 31 August 2010

Recommendations

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

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)

Cited In (30)

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

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)