CSC507/609-H: Cryptography
Prof. B. Rosenberg
Fall Semester, 2005-6 (062)
MWF 3:35-4:25
Memorial Building, Room 300
Exams:
Announcements
Class Notes
- Introduction
- Classical ciphers
- Modern Block and Stream ciphers:
- Modes of operation
- Public Key Cryptography: RSA
- Public Key Cryptography: Discrete Logs
- Generators, Discrete Log
- DL assumption
- Diffie-Hellman Protocol
- El Gamal encryption
- Pohlig-Hellman Algorithm
- Second-bit security
- Hash functions
- Definitions
- Merkel-Damgard construction
- Chaum-vanHeijst-Pfitzmann
- SHA-1
- Signatures
- Secret Sharing
- Bit commitment/games
- Zero-Knowledge
- The Knowledge Complexity of Interactive Proof-Systems,
Goldwasser, Micali and Rackoff. 1985. Original version (PDF)
- The Knowledge Complexity of Interactive Proof Systems,
Goldwasser, Micali and Rackoff. SIAM J. Comput 1989. (PDF)
- Proofs that Yield Nothing But Their Validity,
or All Languages in NP Have Zero-Knowledge Proof Systems,
Goldreich, Micali, Wigderson (PDF)
Homework
- See NOVA program Decoding
Nazi Secrets. Solve the Cipher (note: Shockwave plugin required.)
Send me the signer's name as proof of success.
- Assigned problems from book, chapter 2. Due Monday, 27 Feb.
- Assigned problems from book, chapter 3. All even numbered
Exercises, all odd numbered Computer Problems, in first edition.
References
- Enigma, Wladyslaw Kozaczuk. Articles on reconstruction and
breaking of Enigma by Polish mathematicians prior to WWII.
- Breaking Tunny by Tutte. Article on
reconstructing the masking sequence for encryption of German High
Command network.
- John
Savard's page on machine ciphers.
- Biham, Eli,
Cryptanalysis
of multiple modes of operation ,
J. Cryptology
11:1
(1998) 45-58.
- Biham, Eli,
Cryptanalysis of triple modes of operation,
J. Cryptology
12:3
(1999) 161-184.
- Cramer, Gennaro, Schoenmakers, A secure
and optimally efficient mutli-authority election scheme, Eurocrypt 97.
- Jens
Groth, Extracting
witnesses from proofs of knowledge in the random oracle model
- Cramer, Damgard, Schoenmakers, Proofs
of partial knowledge and simplified design of witness hiding
protocosl, Crypto 94
- Michael Ben-Or, Shafi Goldwasser, Avi Wigderson, Completeness
theorems for non-cryptographic fault-tolerant distributed computation,
Proc. 20-th ACM Symposium on Theory of Computing, 1988. pp 1-10.
- Pascal Junod, Cryptographic Secure Psudo-Random
Bit Generation: The Blum-Blum-Shub Generator.
- John Milne, Elliptic
Curves
Cryptographic Games
- MIT 6.876, Course
in Cryptographic Game Theory.
- The Knowledge Complexity of Interactive Proof-Systems
(PDF)
- Proofs that Yield Nothing But Their Validity,
or All Languages in NP Have Zero-Knowledge Proof Systems
(PDF)
- How To Play Any Mental Game
(PDF)
- Equivalence between two flavours of oblivious transfers
(PDF)
- Completeness Theoerms for Fault Tolerant Distributed Computing
(PDF)
- Parallel Reducibility for Information-Theoretically Secure Computation
(PDF)
SliceOfLife