Date | Topic | Relevant Reading | Homework |
---|---|---|---|

Aug. 30 | The goal of modern cryptography; Perfect secrecy via the one-time pad; | 1.1 - 1.4, A.3, 2.1, 2.2 | Hw1 out |

Sept. 6 | limitations of perfect secrecy; definitions of computational security; Security reductions; Pseudorandom generators; proof of security for pseudo-OTP; Chosen plaintext attack security | 2.3, 3.1, 3.2.1, 3.3, 3.4 | Hw1 due (9/8 is fine). Hw2 out. |

Sept. 13 | Pseudorandom functions; achieving CPA security; pseudorandom permutations and block ciphers | 3.5 | |

Sept. 20 | Modes of operation in block ciphers; Chosen Ciphertext Attack security; message authentication | 3.6, 3.7, 4.1-4.3.1 | Hw2 due. Hw3 out |

Sept. 27 | Message authentication for arbitrary length messages; CBC-MAC | 4.3.2, 4.4.1 | |

Oct. 4 (To be rescheduled.) | authenticated encryption; Hash functions, collision resistance, birthday attacks and HMAC | 4.5, 5.1, 5.3, 5.4.1 | HW 3 due. |

Oct. 11 | No Class | ||

Oct. 18 | Midterm (in class) | ||

Oct. 25 | Proof of work; blockchains; bitcoin | TBD | |

Nov. 1 | Practical constructions of stream ciphers and block ciphers. Substitution-permutaton networks; attacks on reduced round SPNs; Feistel networks | 6.1.1-6.1.3, 6.2.1 - 6.2.2 | |

Nov. 8 | Searchable symmetric encryption and encrypted databases | TBA | |

Nov. 15 | Basic number theory; Algorithmic number theory; Modular Arithmitic; Group theory | 8.1.1 - 8.1.4, B.1, B.2.1 - B.2.3 | Hw4 out. |

Nov. 22 | Factoring; RSA assumption; Discrete log assumption | 8.1.5, 8.2.1, 8.2.3, 8.2.4, 8.3.1 - 8.3.3 | |

Nov. 29 | Diffie Hellman; Hybrid Encryption; El Gamal encryption | 10.1 - 10.4, 11.1, 11.2.1, 11.4.1, 11.3.1 | Hw4 in. Hw5 out. |

Dec. 6 | RSA Encryption; Padded RSA; Digital Signatures; Hash and Sign | 11.2.2, 11.5.1, 11.5.2, 11.5.4, 12.1-12.4 | Hw5 in. |

Dec. 13 ?? | Final Exam (in class) |