# Lecture plan

This plan will change through the semester.

Chapter numbers refer to Stinson, except where marked. HAC is the Handbook of Applied Cryptography.

Week | Topic | Key words | Chapters |
---|---|---|---|

34 | How to agree on a secret and what to do with it | Diffie-Hellman. Classical ciphers, confidentiality, perfect security | 11.2, 1.1, 1.2, 2.3 |

35 | Classical ciphers, modern ciphers, integrity, message authentication codes | 1.1, 1.2, 3.1, 3.2, 3.6, 4.4, 4.5, HAC 4.5 | |

36 | How to break DH | Primality testing. | 5.4 |

37 | Finite cyclic groups. Pohlig-Hellman. Baby-step-Giant-step. | 6.2 | |

38 | Pollard's rho. Generic groups. | 6.2, 6.3 | |

39 | Finite fields, index calculus. | 6.2, 6.3, 6.4 | |

40 | Elliptic curves | 6.5 | |

41 | Elliptic curves | 6.5 | |

42 | Public key encryption | ElGamal/RSA | 5.1, 6.1, 6.7, 5.3 |

43 | RSA, Pollard's rho and p-1, Index calculus for factoring | 5.5-5.6, 5.7.1-2 | |

44 | Hash functions | Collisions, preimages, second preimages, iterated hash functions | 4.1-4.3 |

45 | Digital signatures | RSA. Schnorr signatures and zero knowledge. | 7.1-7.2, 7.4.1, 7.5.2 |

46 | Electronic voting | ||

47 | Summary |