Class Information

Lectures

Class Information
FINAL EXAM MONDAY DEC. 15, 1 - 3PM in ME261 Class Overview The class is an introduction to cryptography basics: classic historical ciphers including Caesar, Vigenere and Vernam ciphers; modern ciphers including DES, AES, Pohlig-Hellman, and RSA; signatures and digests; key exchange; simple protocols; block and stream ciphers; network-centric protocols. For a detailed syllabus see Lectures section below. Instructor Cristina Nita-Rotaru Email: crisn@cs.purdue.edu. Office hours: by appointment LWSN 2142J TA TBA Email: Office hours: Class Schedule Tu Th 1:30pm -2:45pm Textbook Introduction to Cryptography with Coding Theory, Second Edition. Wade Trappe and Lawrence C. Washington. Other references: Alfred J. Menezes, Paul C. Oorschot, and Scott A. Vanstone: Handbook of Applied Cryptography. CRC Press 1996. Bruce Schneier: Applied Cryptography, Second Edition. William Stallings: Cryptography and Network Security: Principles and Practice, Third Edition. Mailing list The class mailing list is cs355. To be added to the list sent an email to mailer@cs.purdue.edu, with the body containing the text 'add your_email to cs355'. Academic Integrity Academic Honesty and Ethical behavior are required in this course, as it is in all courses at Purdue University ( here is the guide for academic integrity). The class will be conducted according to the policy written by Professor Gene Spafford. Please take the time to read it carefully. This will be followed unless I provide written documentation of exceptions. You are encouraged to talk with the professor about any questions you have about what is permitted on any particular assignment. Grading The grade will be based on written homework assignments (HW), two programming projects (PP), midterm (ME), a final exam (FE) and class participation(CP), as follows: Grade = 20% * HW + 20% * PP + 20% * ME + 30% * FE + 10%*CP. Exams are closed books and closed notes.
Lectures
Lecture slides will be posted below. Homework and projects will be handed in class. Week Tuesday Thursday Week 1 Lecture 1 - Introduction, attacks against symmetric cyphers, models to evaluate security. Lecture 2 - Basic ciphers: shift, substitution and Vigenere ciphers. Week 2 Lecture 3 - Cryptanalysis of Vigenere. HW1 and PRJ1 handed. Lecture 4 - Enigma machine. Week 3 Lecture 5 - One-time pad. Perfect secrecy. Lecture 6 - DES. HW1 due Sept.11 in class PRJ1 due Sept.12 11:59AM. Week 4 Lecture 7 - Encryption modes. HW2 will be assigned PRJ2 will be handed. Lecture 8 - Cryptanalysis of DES. AES. Week 5 Lecture 9 - Number theory. HW2 due in class Lecture 10 - Number theory. Week 5 Lecture 11 - Number theory. PRJ2 due Tuesday Sept. 30, 11:59AM HW3 handed in class. Lecture 12 - Number theory. RSA. Week 7 (MIDTERM EXAM this week Lecture 13 - MIDTERM REVIEW. HW3 due in class Lecture 14 - MIDTERM IN CLASS. Week 8 OCTOBER BREAK Lecture 15 - Public-key cryptography. RSA. Selection of PROJECT3 starts Week 9 Lecture 16 - Biometrics Lecture 17 - Attacks against RSA. Hw4 will be assigned. Week 10 Solving midterm. Selection of PROJECT3 ends Lecture 18 - Discrete Logarithms. Diffie-Hellman. ElGamal. Week 11 Lecture 19 - Security of ElGamal. Hash functions. Lecture 20 - Hash Functions. SHA1. Message Authentication Codes. HMAC. HW4 due in class Week 12 Lecture 21 - Digital signatures. RSA HW5 will be assigned Lecture 22 - Digital signatures, ElGamal, DSA. Week 13 Lecture 23 - X509. PGP. Authentication protocols. Lecture 24 - Kerberos. Week 14 Lecture 25 - Kerberos HW5 due in class THANKSGIVING. NO CLASS Week 15 Lecture 26 - IPSEC Lecture 27 - SSL. PROJECT 3 due DECEMBER 5 at MIDNIGHT. THERE ARE NO LATE DAYS. PROJECT DEMOS will be in week 16. Week 16 Lecture 28 - No class. Lecture 29 - FINAL REVIEW.