Semester II of 2014-15

Home >> cs428

Time span: Dec 29, 2014 to April 28, 2015

Academic integrity: Read the honor code carefully if you are taking or planning to take this course.

Instructor: Souradyuti Paul (Office hours: Fri 3:30 to 4:30pm, 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 & Wed 6:30 to 8:00pm, Room: S5-201

Group email:  (private group, reg. required)

Teaching assistant: Murali Krishna Enduri (office hours by appointment)

Reference books: 
- Cryptography: Theory and Practice, D. Stinson, 3rd Edition
- 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

- 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

 Day  Date  Topics, lecture notes and further reading*  Home assignments**  Practice Problems***
 1  Tue  12/30  Admin. info. and Introduction  
 2  Wed  12/31  Classical ciphers: Note 1Note 2  HA1  Problem set 1
 3  Tue  1/6  Euclid's algos, Polyalphabetic ciphers  HA2 in lecture note  
 4  Wed  1/7  Attacks on classical block ciphers    
 5  Tue  1/13  Block cipher modes  HA3  
   Wed  1/14  Holiday    
 6  Tue  1/20  Quiz-1 (30 min.), DES (Read Ch 3.2, W. Stallings)
2DES, 3DES (Read Ch. 6.1, W. Stallings)
 7  Wed  1/21  Random function, MITM Attack, Stream ciphers    Problem set 2
 8  Tue  1/27  Hash function basics and generic attacks
(Also read: Ch. 4.1, 4.2.1 and 4.2.2 Stinson)
 9  Wed  1/28  Hash function modes and SHA-1
(Reading: Ch 4.3.1 and 4.3.2 Stinson)
 10  Tue  2/3  MAC basics and generic attacks
(Reading: Ch 4.4.1 and 4.4.2 Stinson)
 11  Wed  2/4  HMAC and CBC MAC
(Reading: Ch 4.4.1 and 4.4.2 Stinson)
   Problem set 3
 12.  Tue  2/10  Intro. to public key crypto., math background
(Ch 5.1, 5.2.1, 5.2.3)
 13  Wed  2/11  Quiz-2 (50 min.), Math background (cont.)
(Ch 5.2.3)
   Tue  2/17  Holiday    
 14  Wed  2/18  RSA cryptosystem and correctness
(Ch 5.3)
   Sun  2/22  Midsem exam (2:30 to 4:30pm, S3-201)    
No classes due to midsem exam and subsequent recess    
 15  Tue  3/10 Square-and-multiply algo.,(Ch 5.3)     
 16  Wed  3/11  Quadratic residue, Primality testing (Ch 5.4)    
 17  Tue  3/17  Integer factoring: Pollard rho (Ch 5.6.2)    Problem set 4
 18  Wed  3/18  EL Gamal crypto, computing discrete log.:Pollard rho (Ch 6.1 and 6.2.2)    Problem set 5
 19  Tue  3/24  RSA Signature scheme (Ch 7.1)    
 20  Wed  3/25   Quiz-3 (1 hr), El-Gamal Signature scheme (Ch 7.3)    
 21  Tue  3/31  Security req. of a sig. scheme, Existential forgery (Ch 7.2)    
 22  Wed   4/1  Schnorr and DSA Signature schemes, Lamport scheme (Ch 7.4.1, 7.4.2, 7.5.1)   Project assignment  Problem set 6
 23  Tue   4/7  Identification and entity authentication
(Ch 9.1, 9.2 and 9.3)
   Problem set 7
 24  Wed   4/8  Key distribution, Kerberos, Key agreement
(Ch 11.1, 11.2.1, 11.2.2)
   Problem set 8
   Tue  4/14  Holiday    
 25  Wed  4/15  Quiz-4 (30 min.) Secret sharing: Shamir's scheme, Monotone circuit construction
(Ch. 13 only up to 13.2.1 )
  Examples in the relevant sections.
 26  Tue  4/21 SSL and PGP protocols
(Ch. 12.1.1 and 12.3.4)
   Not in syllabus
 27  Wed  4/22  Complex crypto-protocol: Bitcoin, good bye!    Not in syllabus
   Sun  4/26  Endsem exam (2:30 to 4:30pm, Room: TBA)    
   Tue  4/28  Project demo.    

*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.