Computer Science COMP-547B
Cryptography and Data Security

---

Instructor: Prof. Claude Crépeau

---

---

———————————— ———————————— BELOW THIS LINE : UPDATE REQUIRED FOR 2018 ———————————— ————————————

---

---

---

Send comments/questions to cs547@cs.mcgill.ca

---

FINAL EXAM 1999 Ignore Q5.
FINAL EXAM 2000 Ignore Q2.
FINAL EXAM 2001 Ignore Q5 (b) & (c)
FINAL EXAM 2003 Ignore Q5 (c) & (d)
FINAL EXAM 2005 Ignore Q5 (b) & Q6.
FINAL EXAM 2006 Ignore Q1, Q5 & Q6.
FINAL EXAM 2007 Ignore Q1 & Q5.
FINAL EXAM 2008 Ignore Q2.
FINAL EXAM 2009
FINAL EXAM 2010 Ignore Q4.
FINAL EXAM 2011 Ignore Q5 iv).
FINAL EXAM 2013 Ignore Q6.
FINAL EXAM 2014
FINAL EXAM 2015
FINAL EXAM 2017
FINAL EXAM 2018
FINAL EXAM 2020

---

Description: (4 credits, 3 hours). This course presents an in-depth study of modern cryptography and data security. We investigate four important subjects of cryptography: data encryption, message authentication, user identification and key distribution. The basic information theoretic and computational security of classical and modern cryptographic systems are analysed. The course is self-contained and all necessary mathematical background will be explicitely covered.

Mandatory textbook:
Introduction to Modern Cryptography 2nd Edition , by Jonathan Katz and Yehuda Lindell.
Publisher: Chapman and Hall/CRC Press, Nov 2014.

Errata

Mandatory use of MAPLE :
Available labs with maple 16 installed : lab2-X, open-X, lab6-X, lab7-X, lab9-X, where X is from 1 to approximately 25.
Any student taking a cs course either has or can create a CS account.

---

useful books:

• Doug Stinson.
  
  Cryptography - Theory and Practice (third edition)
  
  
• Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone
  
  Handbook of Applied Cryptography ,
  CRC Press, 1996.
• Henk van Tilborg, Editor
  
  Encyclopedia of Cryptography and Security ,
  Springer-verlag, 2005.
• Oded Goldreich,
  
  Foundations of Cryptography: Basic Tools.
  Cambridge University Press.
• Oded Goldreich,
  
  Foundations of Cryptography: Basic Applications.
  Cambridge University Press.
• Mike Luby,
  
  Pseudorandomness and Cryptographic Applications ,
  Princeton University Press, 1996.
• Eric Bach and Jeffrey Shallit,
  
  Algorithmic Number Theory, Volume I: Efficient Algorithms
  MIT Press, 1996
• Gilles Brassard et Paul Bratley,
  
  Fundamentals of Algorithmics,
  Prentice-Hall, 1996.
• Thomas H. Cormen, Charles E. Leiserson et Ronald L. Rivest,
  
  Introduction to Algorithms,
  MIT Press, 1990.

---

Send comments/questions to cs547@cs.mcgill.ca

Last update 08/04/2018