Date  Topic 
May 27 
Efficient cryptographic construction using weak pseudorandom objects:
An introduction to theory and applications of expander graphs.

May 20 
The HastadImpagliazzoLevinLuby (HILL): pseudorandom generators from any oneway function
(this is the last part of the Fundamental Theorem of PrivateKey Cryptography)

May 13 
The details of the ImpagliazzoRudich impossibility result
Back to privatekey primitives: the leftover hash lemma.

May 6 
Finishup the hardness amplification proof
Blackbox and nonblackbox constructions: the Impagliazzo and Rudich impossibility result
of basing publickey cryptography on publickey cryptography 
Apr 29 
LubyRackoff: constructing pseudorandom permutation generator.
Yao's XOR lemma. Weak vs strong oneway functions

Apr 22 
The MansourKushilevitz (Fourier analysis based) proof for GL 
Apr 15 
More on Fourier analysis on the boolean cube 
Apr 12 
Introduction to Fourier Analysis on the boolean cube: towards a 2nd proof for GL 
Apr 8 
The "pairwiseindependence"based proof of the GoldreichLevin (GL) Theorem 
Apr 1 
Hybrid arguments (addon to the 2nd lecture).
Yao's unpredictability implies pseudorandomness.
An overview of the GoldreichLevin hardcore bit theorem. 
Mar 25 
Types of adversaries. A diversion to Computational Complexity.
Circuits vs Turing Machines: Cook's theorem. Nonuniformity and derandomization. 
Mar 15 
P vs NP and Cryptography, averagecase forms of NP.
How to structure a typical argument in Cryptography?
From pseudorandom generators to oneway functions.
From onetime pad to privatekey encryption.
Arbitrary polynomial stretch pseudorandom generators. 
Mar 11 
Course Overview
Introduction to theoretical cryptography. Privatekey Encryption, Pseudorandom generators, oneway functions 