This course is an introduction to the basic concepts and mechanisms of applied cryptography and data security. It will cover both cryptographic primitives (secret key encryption, public key encryption, digital signatures) and security protocols (user authentication). It also emphasizes on discussing the challenges when applying cryptographic building blocks to solve practical security problems, including cloud computing, mobile crowdsourcing networks, and distributed systems. (The content and syllabus are subject to adjustment during the semester.)
Prerequisites: The course is self-contained, however a basic understanding of probability theory and modular arithmetic will be helpful.
Monday/Wednesday, 2:20 pm - 3:45 pm, Dunn Hall 109
By appointment only (Please arrange by email 2-3 days in advance)
- A Graduate Course in Applied Cryptography by D. Boneh and V. Shoup. Free! (recommend for Ph.D. students)
- Handbook of Applied Cryptography by A. Menezes, P. Van Oorschot, S. Vanstone. Free!
- Introduction to Modern Cryptography by J. Katz and Y. Lindell. (UofM library available)
Grading: Your final grade will come from the following sources: class attendance (CA), homework assignments (HA), in-class presentations (IP), and one in-class exam (IE). Here is the grading formula:
Grade = 0.1*CA + 0.2*HA + 0.3*IP + 0.4*IE
Grading Scale: A: 85 – 100, B: 70 – 84, C: 60 – 69, D: 50 – 59, F: 49 and below. (Plus/minus grading will be used).
- Late Policy: Without prior request, no late work will be accepted. All late submission maybe accepted at a penalty of 15% per day for no more than THREE days.
- Testing Policy: The exam given is closed book/note/laptop/neighbor. But students are allowed to bring one cheat sheet (letter-sized 8.5-by-11) for quick reference. There will NOT be any makeup exams unless there is a documented emergency.
- Homework Assignment and Project Report Policy: It is recommended that students use a word processing software (e.g., Word or LaTeX) to type their homework solutions or project report, then submit well-formatted PDF files.
- Presentation Schedule (anonymous)
- Presentation Evaluation Form
- Jan 22 - Lecture 1: Introduction to Cryptography and Data Security (Slides 1)
- Week 02:
- Week 03:
- Week 04:
- Week 05:
- Week 06:
- Mar 02 - Lecture 12: Public Key Encryption - RSA (Slides 12)
- Mar 04 - Lecture 13: Public Key Encryption - ElGamal
- Spring Break
- Mar 16 - Lecture 14: Message Integrity - Message Authentication Codes
- Mar 18 - Lecture 15: Collision Resistance and HMAC
- Mar 23 - Lecture 16: Digital Signature
- Mar 25 - Lecture 17: Authenticated Encryption I
- Mar 30 - Lecture 18: Authenticated Encryption II
- Mar 01 - Lecture 19: Cloud Security and Attribute-based Encryption
- Apr 06 - Presentation 1
- Apr 08 - Presentation 2
- Apr 13 - Presentation 3
- Apr 15 - Presentation 4
- Apr 20 - Presentation 5
- Apr 22 - Presentation 6
- Apr 27 - Review
- Apr 29 - In-class Exam