Monroe Hall B32

Email: arkady@gwu.edu

Office: SEH4570

Office hours: Monday 3:30-5:00, Wednesday 3:00-4:00

Exam 1 | 25% | (10% floating) |

Exam 2 | 25% | |

Homework | 50% | |

Class participation | 10% |

Homeworks will be assigned approximately every two weeks. Homeworks are due
before class (by 12:45PM) on the due date. They must be submitted via
Blackboard by this time to receive
credit. Homeworks can be typed using your favorite tool (I am happy to help
anybody interested in learning LaTex) or handwritten and scanned. But, make
sure that what you submit is legible as it is what will be graded. **No late
homeworks will be accepted!**

Students are welcome to work together on homeworks, however each student must write up and submit their own solutions. If you work on the homework with someone else, you MUST acknowledge them on your submitted homework.

Additionally, you may use outside resources (e.g., web search, other text books, lecture notes) to help with the homework. However, if you use any such resource, you MUST cite them appropriately. Moreover, the solutions you submit MUST be your own. Make sure to write-up your own answers and that you understand them, copying and pasting solutions is not acceptable. Submitted homeworks violating these guidelines will be considered in breach of the academic integrity code and will be prosecuted accordingly.

There will be 6-7 homework assigments over the course of the semester. The final homework grade will be the average of all homework scores with the lowest score dropped.

Date | Lecture Topic(s) | Reading | HW Out | HW Due | Quiz |

Aug. 26 | Probability review, principles of modern cryptography, perfect secrecy and the one-time pad | A.3, Chapters 1, 2 | HW0, HW1 | Quiz 1 | |

Sep. 2 | Labor day: no class | HW0 due | |||

Sep. 9 | Asymptotics review, Limitations of perfect secrecy, computationally-secure encryption, proofs by reduction, pseudorandom generators | A.2, 3.1, 3.2, 3.3 | HW2 | HW1 due | Quiz 2 |

Sep. 16 | Review of PRG and computationally-secure encryption, Proof of security of PRG+OTP encryption, pseudorandom functions | 3.3, 3.5.1 | Quiz 3 | ||

Sep. 23 | CPA security, construction of CPA-secure encryption | 3.4, 3.5 | HW2 due | ||

Sep. 30 | modes of operation, CCA-secure encryption, padding oracle attack, Message authentication codes definitions and construction | 3.6, 3.7, 4.1, 4.2, 4.3.1 | HW3 | Quiz 4 | |

Oct. 7 | Review MAC definition, CBC-MAC, authenticated encryption, hash function definitions and applications, review for exam | 4.2 - 4.5, 5.1, 5.6 | HW3 due | ||

Oct. 14 | Exam 1 (in class) | ||||

Oct. 21 | Fall break (no class) | HW4 | |||

Oct. 28 | Practical constructions of symmetric-key primitives, DES, 3DES, AES, Feistel networks | Intro of chapter 6, 6.2 (All except 6.2.6), 6.3.1 | |||

Nov. 4 | Number theory, group theory | 8.1, B.1.2 | HW5 | HW4 due | Quiz 5 |

Nov. 11 | Cryptographic assumptions, Key exchange, Public-key encryption, Diffie-Hellman, El Gamal | 8.3 (except for 8.3.4), 8.4, 10, 11.1, 11.2 (through 11.2.1), 11.4.1 | Quiz 6 | ||

Nov. 18 | El Gamal, RSA, Paillier, CCA security | 11.4.1, 11.5.1, 11.5.2, 13.2 | HW6 | HW5 due | Quiz 7 (same as HW problems) |

Nov. 25 | Digital signatures, Hash-and-sign, RSA Signatures, Signatures from hashing | 12.1-12.4, 12.6, 12.7 | Quiz 8 | ||

Dec. 2 | Advanced Topics, review for exam | HW6 due | |||

Dec. 9 | Exam 2 (in class) |