General pseudo-random generators from weaker models of computation

DOI10.1007/978-3-642-10631-6_110MaRDI QIDQ3652295zbMATH OpenOpenAlexFDO

Authors George Karakostas

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_110

zbMATH Keywords

circuit complexitymonotone circuit complexitypseudo-random generators

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• A Pseudorandom Generator from any One-way Function
• The complexity of constructing pseudorandom generators from hard functions
• Theory of Cryptography
• Pseudorandom generators without the XOR lemma
• A primer on pseudorandom generators

Cited in

(5)

• Computing with Very Weak Random Sources
• On derandomization and average-case complexity of monotone functions
• Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace
• Pseudo-random generators for all hardnesses
• scientific article; zbMATH DE number 7754310 (Why is no real title available?)

This page was built for publication: General pseudo-random generators from weaker models of computation

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