Topics covered:

• Applications of PRFs

Note: The second half of Lecture 5, Number Theory, is contained in Lecture 6.

Topics:

• Stateless Secret-key Encryption with PRF.
• The Goldreich-Goldwasser-Micali (GGM) PRF construction.

Topics:

• The Hybrid Argument.
• An application: PRG length extension.
• The notion of pseudorandom functions: Definition, motivation, discussion and comparison with PRGs.
• PRG implies (stateful) secret-key encryption.
• PRFs imply (stateless) secret-key encryption.

Science wins either way.

Topics:

• How to circumvent Shannon’s lower bound: the computational adversary
• Definition of computational security
• The definition of pseudorandom generators(PRG)

Everything you’ve ever wanted is on the other side of fear.

Topics:

• Introduction to cryptography
• Secure Communication and Shannon’s definitions of perfect secrecy
• Perfect Indistinguishability definitions.
• The One-time pad construction
• Shannon’s lower bound.