Materials

Use the raw slides (pdf) before lecture to take notes.

Summary

• Review: Security against computationally bounded adversaries (run in polynomial time)
• Review: success of the adversary must be small (how small?)
• Pseudo-random generators
• RC4, other failed constructions
• Salsa, Chacha: modern secure constructions
• Is IND enough ?
• INDCPA game allows an adversary to ask for encryptions of any messages they want.
  • Why is this more secure?
• Pseudo-random functions (PRFs)
• INDCPA-secure encryption