CSEP 590: Applied Cryptography (Spring '23)
[General Info] [Team] [Weekly Schedule] [Resources] [Interaction / Q&A] [Grading Policy] [Schedule and Homework]
General information
 Topics: Basic cryptographic
primitives (block ciphers, secret and publickey
encryption, authenticated encryption, message
authentication, signatures, ...), cryptographic protocols
(e.g. TLS), attack vectors (paddingoracle attacks,
sidechannel attacks, etc). Also, advanced
cryptographic techniques (zeroknowledge proofs,
multiparty computation,...).
The class will adopt rigorous security definitions and statements, but mostly replace proofs with attackdriven intuition.  Prerequisites: No formal prerequisites, except for basic mathematical proficiency as expected in an undergraduate CS program, as well as a certain affinity to rigorous thinking. Basic programming skills (we will mostly use Python).
Team
Instructor: Huijia (Rachel) Lin, rachel(at)cs(dot)washington(dot)edu
Teaching assistant
 Champ ChairattanaApirom (rchairat@cs)
 Sela Navot (senavot@cs)
Weekly schedule
 Class time and location
Monday 6:309:20pm, CSE2 G20 (with live streaming on Microsoft campus)  Class Recording Lectures are recorded and recordings are available here
 Office hours
Rachel: Tues 5:006:00pm on Zoom or by appointment
Sela: Mons: 5:156:15pm in person
Champ: Weds 5:156:15pm on Zoom
Office hour starts in the second week. Zoom links are posted on Edstem
Resources
No mandatory textbook. Slides will be made available (password protected).
The following are lecture notes/textbooks on cryptography (all but one free), which (often) adopt a more formal approach than the one from this class.
 D. Boneh and V. Shoup, A Graduate Course in Applied Cryptography. (Great overlap with class, just with more proofs.)
 M. Bellare and P. Rogaway, Introduction to Modern Cryptography. (An excellent reference for a concrete security treatment, albeit somewhat incomplete.)
 M. Rosulek, The Joy of Cryptography. (Undergraduatelevel introduction to cryptography.)
 J. Katz and Y. Lindell, Introduction to Modern Cryptography. (An actual textbook.)
Grading
 Homework: There will be 6 problem
sets distributed over the quarter. Problem sets are generally
posted online on Tuesdays, by 11:59pm PST, and are due on
Thursdays, 11:59pm PST, the following week. Homework will be graded and you are required to
hand in your own solution for each homework. (Refer to the "Academic
Integrity" paragraph below for further details.) The lowest grade among the
6 homework will be dropped. You are allowed 5
late days overall throughout the quarter.
Homework submissions will be online via Gradescope (instructions will be provided soon).  Project: An important component of this class
will be a project, to be undertaken by teams of two
students. (Exceptions can be made but are not the norm.) The
final outcome of the project is a report (we will likely
dispense with presentations, due to the projected high number
of students).
Examples of projects include (but are not limited to):
 Reading a research paper and/or a cryptographic standard/RFC (either existing, or a current proposal), and writing a summary.
 Studying a realworld application or implementation of cryptography (either a wellknown one, or something specific to your personal experience) and documenting it (or formalizing the underlying threat model).
 Some cryptographyspecific implementation problem.
 Anything else really, just let your creativity flow.
 Final grade: The final grade will be distributed as follows: Homework (60%), project (40%). The lowest homework score will be dropped. Participation (in class and online) will be taken into account for partial bonus credit in borderline cases.
 Academic Integrity: Homework assignments are meant to be solved individually, whereas collaboration with a teammate is required for the project component of the class. Please refer to the Allen School's Academic Misconduct webpage for a detailed description of what is allowable and what is not.
 Religious Accommodation Policy: See here for the current policy.
Schedule and Homework
The following is a tentative schedule, and is intended to give a rough idea about what I hope to cover in the class and in which order. There will be (slight) shifts depending on the pace of the class.
Week  Date  Lecture contents  Homework and Project 

1  20230327 
Introduction
 
2  20230403 
Block Ciphers


3  20230410 
Wrapping Up Encryption


4  20230417 
Authenticated Encryption


5  20230424 
Publickey Cryptography


6  20230501 
Certificates, PKIs, and authenticated key exchange


7  20230508 
Identification protocols


8  20230515 
Case study: Secure Messaging


9  20230522 
Multiparty computation


10  20200529  Memorial Day 