Documentation

Complexity.Computability.Circuit.Boolean.NaturalProof.Generator

The natural proofs barrier from pseudorandom generators #

Razborov and Rudich derive the hypothesis of the natural proofs barrier, an exponentially secure keyed family of Boolean functions with members of polynomial circuit size, from a pseudorandom generator secure against circuits of size 2 ^ (k ^ ε), by the construction of Goldreich, Goldwasser and Micali [RazborovRudich1997, Section 4], [GGM86]. With the GGM family of Cslib.Crypto.GGM.booleanFamily, whose members have circuits of polynomial size (Cslib.Crypto.GGM.complexity_booleanFamily_le) and which is exponentially secure for subexponentially secure generators (Cslib.Crypto.GGM.isExponentiallySecure_booleanFamily), the barrier Cslib.Circuits.Boolean.not_isUseful_PPoly_of_isNatural applies.

Main results #

References #

The natural proofs barrier from pseudorandom generators [RazborovRudich1997, Section 4]. If a family of length-doubling generators of polynomial circuit complexity is subexponentially secure against circuits, then no P/poly-natural property is useful against P/poly. The GGM functions with keys of length polynomial in the number of inputs form an exponentially secure keyed family whose members have circuits of polynomial size (Cslib.Crypto.GGM.isExponentiallySecure_booleanFamily, Cslib.Crypto.GGM.complexity_booleanFamily_le).