Friday, February 20, 2015

Lecture 20

Cryptographic versus Complexity pseudorandom generators

A Pseudorandom Generator from any One-way Function by Johan Håstad, Russell Impagliazzo, Leonid A. Levin and Michael Luby

Pseudo-random generators for all hardnesses by Chris Umans

Lecture Notes by Peter Ralli


No comments:

Post a Comment