How strong is Nisanʼs pseudo-random generator?


We study the resilience of the classical pseudo-random generator (PRG) of Nisan [Nis92] against space-bounded machines that make multiple passes over the input. Our motivation comes from the derandomization of BPNC. Observe that if for every log-space machine that reads its input n times there is a PRG fooling this machine, then in particular we fool NC… (More)
DOI: 10.1016/j.ipl.2011.04.013


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics