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.
Restriction: An introduction to notions of Information Theory is required.
CHECK YOUR GRADES HERE. FINAL GRADES ARE HERE !!!!
HW 4 (pdf format)
REVISED Dec 6th 2005
READING MATERIAL FOR CLASSES
1. Number Theory and finite fields (from Crépeau's COMP-547)
2. Classical coding theory Part I (from Madhu Sudan)
2. Classical coding theory Part II (from Madhu Sudan)
2. Berlekamp-Welch Decoder (from Gemmell-Sudan)
3. Privacy Amplification (from Bennett-Brassard-Crépeau-Maurer)
3. Jensen's Lemma (from Crépeau's COMP-547)
4. Quantum coding theory (from Daniel Gottesman)
4. Quantum coding theory (Slides) (version for printing without yellow background)
5. BB84 QKD and security proof (from Shor-Preskill)
5. BB84 QKD and security proof (Slides) (version for printing without yellow background)
5. Alternative security proof (from Gottesman-Lo)
6. one-time quantum pad and Quantum Vernam cipher (version for printing without yellow background)
6. Quantum Vernam cipher (from Mosca-Tapp-de Wolf)
6. Quantum Vernam cipher (Slides) (version for printing without yellow background)
7. Approximate quantum encryption (from Hayden-Leung-Shor-Winter)
7. Effective approximate quantum encryption (from Ambanis-Smith)
7. Approximate Quantum Encryption (Slides) (version for printing without yellow background)
8. Quantum One-time Authentication (Slides) (version for printing without yellow background)
8. Authentication of quantum messages (from Barnum-Crépeau-Gottesman-Smith-Tapp)
8. Authentication of quantum messages (Slides)
8. Approximate QECC and secret sharing schemes (from Crépeau-Gottesman-Smith)
8. Approximate Quantum Error-Correcting codes (Slides) (version for printing without rainbow background)
9. Uncloneable encryption (from Gottesman)
10. key recycling and known-plaintext attack(from Damgaard-Pedersen-Salvail)
10. Near optimal key recycling scheme (from Damgaard-Pedersen-Salvail)
10. Near optimal key recycling scheme (Slides)
11. Quantum OT and BC (Slides)
11. Quantum OT and BC (Slides) (version for printing without rainbow background)
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.