Sign inSign in

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.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

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

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.