Description: (4 credits, 3 hours).
Review of the basic notions of cryptography and quantum information theory. Quantum key distribution and its proof of security. Quantum encryption, error-correcting codes and authentication. Quantum bit commitment, zero-knowledge and oblivious transfer. Multiparty quantum computations.
Prerequisite: COMP 547 and permission of the instructor.
HW 1 (pdf format)
Due date moved to Feb 10, 2009
HW 1 : Luhn's algorithm examples...(txt format)
Posted Feb 04, 2009, 17h30
HW 2 (pdf format) FINAL VERSION
Due date March 17, 2009
HW 3 (pdf format) Final VERSION (Apr 15, 13:00)
Due date April 20, 2009
READING and PRESENTATION MATERIAL FOR CLASSES
0. Introduction to Quantum Cryptography
0. READINGS: Number Theory and finite fields (from Crépeau's COMP-547)
1. Classical coding theory Part I (from Madhu Sudan) Updated Jan 15, 2009, 14h00
1. Berlekamp-Welch Decoding algorithm (from Gemmel-Sudan) Updated Jan 20, 2009, 14h00
1. Classical coding theory Part II (from Madhu Sudan) Updated Jan 15, 2009, 14h00
1. READINGS: Classical coding theory: Madhu Sudan's lecture notes...
2. Basic Information Theory (from Crépeau's COMP-547)
2. READINGS: Introduction to Information Theory (F. Bavaud, J.-C. Chappelier, J. Kohlas)
3. READINGS: Generalized Privacy Amplification (from Bennett-Brassard-Crépeau-Maurer)
5. Quantum coding theory (from Daniel Gottesman)
Updated Feb 19, 2009, 14h30
6. READINGS: BB84 QKD and security proof (from Shor-Preskill)
6. BB84 QKD and security proof (Slides) Updated Mar 19, 2009, 12h00
6. READINGS: Alternative security proof (from Gottesman-Lo)
6. READINGS: QKD security proof (from Renner)
6. QKD security proof (Slides) Updated Mar 26, 2009, 12h00
7. one-time quantum pad and Quantum Vernam cipher (Slides) Updated Mar 26, 2009, 12h00
7. READINGS: Quantum Vernam cipher (from Mosca-Tapp-de Wolf)
7. READINGS: Effective approximate quantum encryption (from Ambanis-Smith)
8. Quantum One-time Authentication (Slides)Updated Mar 31, 2009, 12h50
8. READINGS: Authentication of quantum messages (from Barnum-Crépeau-Gottesman-Smith-Tapp)
8.5. READINGS: Uncloneable encryption (from Gottesman)
8.5. READINGS: key recycling and known-plaintext attack(from Damgaard-Pedersen-Salvail)
8.5. READINGS: Post-Quantum Cryptography Book (free within McGill)
9. READINGS: Approximate QECC and secret sharing schemes (from Crépeau-Gottesman-Smith)
9. Approximate Quantum Error-Correcting codes (Slides)
10. Classical Interactive Proofs and Zero-Knowledge (Slides)Updated Apr 7, 2009, 11h30
10. READINGS: IP vs AM (from Goldwasser-Sipser)
11. Quantum Interactive Proofs and Zero-Knowledge (Slides)
Useful books:
-
Michael Nielsen and Isaac Chuang
Quantum Computation and Quantum Information
Cambridge University Press
-
Jozef Gruska
Quantum Computing
McGraw-Hill
-
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.
-
Gilles Brassard,
Modern Cryptology
Springer-Verlag, lecture notes in Computer Science, Vol. 325, 1988.
Cryptologie Contemporaine
Masson, 1993.
-
Doug Stinson
Cryptography - Theory and Practice
CRC Press, 1995
-
Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone
Handbook of Applied Cryptography
CRC Press, 1996.
-
Evangelos Kranakis
Primality and Cryptography
B.G. Teubner, 1986
-
Eric Bach and Jeffrey Shallit,
Algorithmic Number Theory, Volume I: Efficient Algorithms
MIT Press, 1996
-
Steven Roman,
Coding and Information Theory
Springer-Verlag, 1992.
-
Micheal Sipser,
Introduction to the Theory of Computation
PWS Publishing, 1997.
-
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.