## Abstract

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 NC^{0}, 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 language | English |
---|---|

Pages (from-to) | 136-145 |

Number of pages | 10 |

Journal | Annual Symposium on Foundations of Computer Science - Proceedings |

State | Published - 2003 |

Externally published | Yes |

Event | Proceedings: 44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003 - Cambridge, MA, United States Duration: 11 Oct 2003 → 14 Oct 2003 |

## Fingerprint

Dive into the research topics of 'On ε-biased generators in NC^{0}'. Together they form a unique fingerprint.