Class Information

Lectures

Class Information
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: MW 3:30 - 4:30 pm, LWSN 2142J TA Aaron Lint Class Schedule MWF 4:30-5:20pm LWSN B134 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. This is a tentative schedule of the course. Week Monday Wednesday Friday Aug. 20 - Aug. 24 Lecture 1 - Introduction Lecture 2 - Attacks against symmetric ciphers; models to evaluate security. Lecture 3 - Basic Ciphers: shift, substitution and Vigenere ciphers. Aug. 27 - Aug. 31 Lecture 4 - Cryptanalysis of Vigenere Cipher. Lecture 5 - Enigma machine. Lecture 6 - One Time Pad. Perfect secrecy. Homework 1 handed. Sept. 3 - Sept. 7 Labour Day, no class. Lecture 7 - Number Theory (1) Lecture 8 - Number Theory (2) Homework 1 due in class. Homework 2 handed. Sept. 10 - Sept. 14 Lecture 9 - DES Lecture 10 - Encryption Modes Lecture 11 - Double and Triple DES Sept. 17 - Sept. 21 Lecture 12 - Cryptanalysis of DES. AES. Lecture 13 - Semantic security. Number theory (3). Homework 3 handed. Homework 2 due. Lecture 14 - Chinese Remainder Theorem. Project 1 handed. Sept.24 - Sept. 28 Lecture 15 - Fermat and Euler's Theorems Lecture 16 - Public-key cryptography. Lecture 17 - RSA. Homework 3 due Oct. 1 - Oct. 5 Lecture 18 - RSA. MIDTERM MIDTERM Project 1 due. Oct. 8 - Oct. 12 FALL BREAK Solving midterm Solving midterm Oct. 15 - Oct. 19 Lecture 19 - Attacks against RSA Lecture 20 - Quadratic residues, RSA, OAEP. Lecture 21 - SRA Mental Poker Game. Oct. 22 - Oct. 26 Lecture 22 - Discrete Logarithm (1) Lecture 23- Diffie-Hellman Lecture 24 - ElGamal. Oct. 29 - Nov. 2 Lecture 25 - ECC. Lecture 26 - Hash functions. Lecture 27 - Hash functions. SHA1 Nov. 5 - Nov. 9 Lecture 28 - Message authentication codes. HMAC Lecture 29 - Digital Signatures, RSA Lecture 30 - Digital Signatures, ElGamal Nov. 12 - Nov. 16 Lecture 31 - X509. PGP. Attend CERIAS Security Seminar - Wireless Router Insecurity: The Next Crimeware Epidemic. Steven Myers, Indiana University. Lecture 32 - Identification protocols. Nov. 19 - Nov. 23 Lecture 33 - Identification protocols. THANKSGIVING BREAK. THANKSGIVING BREAK. Nov. 26 - Nov. 30 Lecture 34 - Kerberos Lecture 35 - Key establishment Lecture 36 - IPSEC Dec. 3 - Dec. 7 Lecture 37 - SSL Lecture 38 - Biometrics Lecture 39 - Review for final