Low-complexity pseudorandom generator

A low-complexity PRG is a pseudorandom generator each of whose output bits is computable in NC^1 (and, for the NC^0 case, depends on a constant number of input bits); its existence is one of the four well-founded assumptions from which JLS21 builds indistinguishability obfuscation.

TODO: syntax and security definition.

Participates in

Builds on Low-complexity pseudorandom generator

• PRG in NC1 ⇒ iO