Time span: Dec 31, 2015 to April 28, 2016
Instructor: Souradyuti Paul (Office hrs: Tue & Th. 5:45 to 6:30pm in faculty lounge@palaj, or by appointment, Office: S5-324)
Goals and coverage: Cryptography deals with the techniques of secret writing. Some of the basic goals of the subject are data confidentiality, data integrity and entity authentication. This course covers a fair number of basic algorithms achieving these goals; some of them are quite well-known and used in practice (DES, RSA, HMAC and DSA, to name a few). These algorithms are taught with examples, home assignments and exercises, where sufficient care is given to the details. We also study the security properties of these algorithms at some depth; however, a full and rigorous mathematical analyses of the security properties are beyond the scope of this course. It is our hope that a student will be able to pursue any advanced study/course/research in cryptography after attending this course. For details of the course coverage read this.
Lecture times: Tue & Th. 6:30 to 8:00pm, Room: 7/105@palaj
Group email: 2016-CS428.pvtgroup@iitgn.ac.in (private group, reg. required)
Teaching assistant: Sudhakar Kumawat & Ananya Shrivastava (office hours by appointment)
Main textbook:
- Cryptography: Theory and Practice, D. Stinson, 3rd Edition
Additional reference books:
- Handbook of Applied Cryptography, A.J.Menezes, P.V. Oorschot and S.Vanstone
(available online freely)
- Cryptography and Network Security, W. Stallings (5th Edition)
Target audiences: B.Tech (third/fourth year), M.Tech/M.Sc and PhD
Pre-requisites:
- CS 321 (Algorithm analysis and design)
- MA 101, 102, 201 and 202 (for mathematical maturity)
- ES 102 (Introduction to computing) or ES 112 (Computing)
- At least one CS project
- Some familiarity with prime/composite numbers
- Absence of hatred/fear of math
Total course credits: 4
Schedule:
*Additional reading materials, in most cases, can be found in lecture notes. Some more advice.
**Instruction on how to submit assignments: here.
***Each lecture note contains a number of examples and practice problems.
|
Home >