On ε-biased generators in NC0

Elchanan Mossel*, Amir Shpilka, Luca Trevisan

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


A pseudorandom generator is an efficient deterministic procedure that maps a shorter random input into a longer output that is indistinguishable from the uniform distribution by resource-bounded observers. Cryan and Miltersen recently considered the question of whether there can be a pseudorandom generator in NC0, that is, a pseudorandom generator that maps n bits strings to m bits strings and such that every bit of the output depends on a constant number k of bits of the seed. It is shown that for k = 3, if m ≥ 4n + 1, it is possible to break the generator with a linear test.

Original languageEnglish
Pages (from-to)136-145
Number of pages10
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
StatePublished - 2003
Externally publishedYes
EventProceedings: 44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003 - Cambridge, MA, United States
Duration: 11 Oct 200314 Oct 2003


Dive into the research topics of 'On ε-biased generators in NC0'. Together they form a unique fingerprint.

Cite this