Monotone Circuits: One-Way Functions versus Pseudorandom Generators

Webpage for a paper by Oded Goldreich and Rani Izsak


We study the computability of one-way functions and pseudorandom generators by monotone circuits, showing a substantial gap between the two: On one hand, there exist one-way functions that are computable by (uniform) polynomial-size monotone functions, provided (of course) that one-way functions exist at all. On the other hand, no monotone function can be a pseudorandom generator.

Material available on-line

Back to either Oded Goldreich's homepage or general list of papers.