CMPT 404 — Cryptography and Protocols

CMPT 404 — Cryptography and Protocols Spring 2015 Instructor: Andrei Bulatov, email: [email protected] TAs: Zhenjian Lu, email: [email protected] Learning resources: • Prerequisites: MACM 201, some knowledge of probability and complexity is helpful, although not necessary. • Lectures: Mo, We, Fr 3:30–4:20pm, in AQ 4150 • There is no single textbook for this course. I will use several books, online lecture notes, papers, and other publications and resources. The most important are – Books: – Cryptography and network security. Principles and practice, by William Stallings, Pearson, 2003: 3rd edition – Introduction to modern cryptography, by Jonathan Katz, Yehuda Lindell, Chapman and Hall, 2008 – Handbook of Applied Cryptography, by lfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanston, CRC-Press, 1996 – Practical cryptography, Niels Ferguson, Bruce Schneier, Wiley Publishing, 2003 – Online lecture notes: – Bellare-Rogaway lecture notes http://www.cs.ucdavis.edu/ rogaway/classes/227/spring05/book/main.pdf

– Goldwasser-Bellare lecture notes http://www.cs.ucsd.edu/users/mihir/papers/gb.pdf

– Barak’s lecture notes http://www.cs.princeton.edu/courses/archive/fall05/cos433

– Biryukov’s lecture notes http://www.wisdom.weizmann.ac.il/˜albi/cryptanalysis

– Other online resources: – Cryptology ePrint archive http://eprint.iarch.org

– Wikipedia Cryptography portal http://en.wikipedia.org/wiki/Portal:Cryptography

– National Institute of Standards and Technology http://csrc.nist.gov/groups/ST/index.html

• Instructor’s office hours: Mo 1:00–3:00pm (starting from Jan 19th) in TASC 8013, or by appointment

• Assignments: 4 sets of exercises • TA’s office hours: TBA Course web page: www.cs.sfu.ca/CC/404/abulatov Please refer to this page regularly for important information related to the course. Course Outline: The course is an introduction into modern cryptography and its applications. It rigorously defines the basic requirements to cryptographic schemes, privacy and authenticity. It introduces required constructions and results, and shows how these constructions and results are used to built provably secure cryptographic schemes. We also consider how these principles are used in the existing systems, and see why many of the widely used protocols such as SSL and SSH may be insecure. Topics to be covered: • Basics of probability, cryptography, and complexity. Historical remarks • Concepts of privacy and authenticity: perfect, statistical, and computational • Pseudo-random generators and functions • One-way functions • Private-key encryption: constructions, block ciphers • Trapdoor functions and public-key encryption • Message authentication, digital signatures, and hashing • Zero-knowledge proofs • Electronic auctions, voting etc. • Cryptographic components of the existing protocols Marking scheme: 4 homework assignments, worth 8% each, 3 quizzes, worth 8%, and final exam, worth 44% or final exam, worth 20% + project, worth 24% Academic Honesty: Academic Honesty plays a key role in our efforts to maintain a high standard of academic excellence and integrity. Students are advised that ALL acts of intellectual dishonesty are subject to disciplinary action by the School; serious infractions are dealt with in accordance with the Code of Academic Honesty (T10.02) (http://www.sfu.ca/policies/teaching/t10-02.htm). Students are encouraged to read the School’s Statement on Intellectual Honesty (http://www.cs.sfu.ca/dean-gradstudies/honesty.html).