ConceptTheory & Algos
Cryptographic pseudorandom generator
A cryptographic PRG is a deterministic polynomial-time computable function that maps a shorter random string to a longer string that is computationally indistinguishable from a truly random string of the same length by any polynomial-time adversary.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.