Monotone circuits: one-way functions versus pseudorandom generators

DOI10.4086/TOC.2012.V008A010MaRDI QIDQ2913810zbMATH OpenOpenAlexFDO

Authors Oded Goldreich, Rani Izsak

Publication date 27 September 2012

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2012.v008a010

zbMATH Keywords

cryptographymonotone circuitsone-way functionspseudorandom generators

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 3990863
• One-way functions and circuit complexity
• One way functions and pseudorandom generators
• A Pseudorandom Generator from any One-way Function
• On derandomization and average-case complexity of monotone functions

Cited in

(5)

• Circular security is complete for KDM security
• On negation complexity of injections, surjections and collision-resistance in cryptography
• On derandomization and average-case complexity of monotone functions
• The power of negations in cryptography
• Negation-limited formulas

This page was built for publication: Monotone circuits: one-way functions versus pseudorandom generators

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