Instructor
Teaching Assistant
Course Announcement
Course Materials
Syllabus
Grading Policy
Useful Links
Texbook: Douglas R. Stinson, Cryptography Theory and Practice (2nd Edition). And the latest Errata.
Time: Tuesday 6:00-9:00PM
Place: 245 CN
Prerequisites: MTH 3001 (Foundations in Mathematics & Theory) or permission
of instructor.
Course Direction: MS: Theory, Networks; PhD: Networks.
This course studies the design and use of cryptographic systems and cryptanalytic attacks; exposes history of cryptographic systems and the mathematics behind them. Covered topics include information theory, stream ciphers and shift register sequences, DES, AES, public key systems, RSA, Discrete Logarithm, Elliptic Curve, hashing functions, signatures, authentication. Also included are some coverage of PKI (Public Key Infrastructure, Electronic Voting, Proof of Knowledge, Secret Sharing Schemes.
Prof. Agnes Chan
Email: ahchan@ccs.neu.edu
Office: 169 CN
Phone: 617-373-2390
Office Hours: Thursday 4:00 - 5:00PM or by appointments
Robbie Ye
Email: robbieye@ccs.neu.edu
Office: 264 Egan
Phone: 617-373-5793
Office Hours: Monday 3 - 5PM
Handouts
Lecture Notes 1 (This link may work for CCS machines only.)
Lecture Notes 2 (This link may work for CCS machines only.)
Lecture Notes 3 (This link may work for CCS machines only.)
Lecture Notes 4 (This link may work for CCS machines only.)
Lecture Notes 5 (This link may work for CCS machines only.)
Lecture Notes 6 (This link may work for CCS machines only.)
Lecture Notes 7 (This link may work for CCS machines only.)
Reading Assignments
Week 1: Stinson book, sections 1.1.1, 1.1.2, 1.1.4, 1.1.6; sections 2.1, 2.2.
Homework Assignments
Homework 1 (Due Oct. 8) (This link may work for CCS machines only.)
Homework 2 (Due Oct. 15) (This link may work for CCS machines only.)
Homework 3 (Due Oct. 22) (This link may work for CCS machines only.)
Homework 4 (Due Nov.5) (This link may work for CCS machines only.)
Homework 5 (Due Nov.26) (This link may work for CCS machines only.)
Bonus Homework (Due Dec.3) (This link may work for CCS machines only.)
Final Projects
Week 1: Introduction and quantitative measure of information.
Week 2: Information Theory, Block Ciphers (DES).
Week 3: AES, Modes of Operation, Cryptanalysis.
Week 4: Stream Ciphers, Cryptanalysis.
Week 5: Hash functions.
Week 6: Public Key Cryptography, RSA.
Week 7: MIDTERM EXAM. Discrete Logarithm and Elliptic Curve.
Week 8: Signature/ Identification Schemes. (Project proposal due.)
Week 9: Protocols and Zero Knowledge Proof.
Week 10: Public Key Infrastructure and Electronic Voting.
Week 11: Secret Sharing Schemes.
Week 12: Project Presentations.
Homework Assignment: 40%
Problem sets are given regularly and are expected to be turned in by the due date and time specified.
Midterm Examination: 30%
An 1.5 hour midterm examination will be given in class on Nov. 5. There will be NO makeup exams given.
Final Project: 30%
A one-page proposal of the final project is due on Nov 12.
Oral presentation will be given on Dec 10. A written paper of no longer than five single-spaced pages (excluding references, codes and figures) will be due on the same date.
Ronald L. Rivest : Cryptography and Security