## Handouts

- Notes on algebra (pdf version)
- Notes on probability (pdf version)
- Lecture notes on the deterministic, poly-time algorithm for determining primality, by B. Gasarch
- Proof of a simplified version of the Goldreich-Levin theorem about the existence of hard-core bits (by Luca Trevisan)
- Proof of security for the PRG construction given in class (superseded by lecture notes for Lecture 12)

## Homeworks (solutions have been taken off-line)

- Homework 1
- Homework 2
- Homework 3
- Homework 4
- Homework 5
- Homework 6