CS.167: Introduction to Cryptography - Spring 2010

• Class meetings:
  MW 2pm-3:20pm, in BH 1200
• Instructor:
  Stanislaw Jarecki. Office hours: W 3:30pm-5pm, Donald Bren Hall, room 4026, email: stasio (at) ics.uci.edu
• Grading:
  5-6 homeworks, including take-home final.
• Text book:
  There's no textbook in the course but I'll put some notes and pointers for you on-line:
  • A very good textbook on cryptogrpahy is "Introduction to Cryptography" by Jonathan Katz and Yehuda Lindell.
  • Here is the link to lecture notes of a similar class taught by Prof. Yevgeni Dodis at NYU
  • Here is the link to lecture notes of a similar class taught by Prof. Mihir Bellare at UCSD
• Homeworks:
  • Homework #1
  • Homework #2
• List of lecture topics:
  • Lect 1-2: Introduction. Here are the slides I followed in the introductory lecture, taken from Mihir Bellare's class (lecture 1).
  • Week 2: Different Notions of Security of Encryption. Classic Ciphers. Perfect Security. One-Time Pad Encryption. Fundamental bound on message size for perfectly secure ciphers. You can read it in first chapter of Yehuda-Lindell, and in Yevgeni's or Mihir's notes, but here are lecture notes for this material form an undergraduate crypto class I taught a few years ago: (lecture notes #1).
  • Weeks 3-4: Computationally Limited Adversaries. Indstinguishability of Encryption against Computationally Limited Aversaries, i.e. (T,e)-indistinguishability. Pseudorandom Number Generators (PRG's). Construction of (T,e)-indistinguishable encryption from (T,e)-secure PRG. Construction of p(n)-bit expanding PRG from 1-bit expanding PRG. Stream Ciphers and their usage of PRG.
  • Week 5: Block Ciphers, DES, Pseudorandom Functions (PRF's), Modeling Block Ciphers as Pseudorandom Functions. Fundamental Limitation against on PRF'ness of Block Ciphers from the Birthday Attack. Mihir Bellare's Lecture Notes on Block Ciphers and DES, Mihir Bellare's Lecture Notes on PRF's and Birthday Attack on PRF'ness of Block Ciphers
  • Week 6: Chosen Plaintext Secure encryption of long messages using various Modes of Operation for block ciphers: CBC, CTR, random and stateful versions. Security results and attacks based on Birthday Attack. Chosen Ciphertext Security. Mihir Bellare's Lecture Notes on Modes of Operation and CCA Security,
  • Week 7: Hash Functions, SHA1 Example, Collision Resistant Functions, One-Way Functions, Merkle-Damgard Transform for constructing CR hash functions on variable-length inputs from CR "compression functions", i.e. CR hash functions on fixed-length inputs. Mihir Bellare's Lecture Notes on Hash Functions,
  • Week 8: Public Key Encryption, CPA-IND security, Diffie-Hellman Key Exchange, ElGamal Encryption, RSA Encryption. Mihir Bellare's Lecture on PKE,