CS 290X Methods of
Cryptography Fall 2007-08
Instructor: J. Yellin,
yellin@soe.ucsc.edu
Meetings: WMF 11-1210pm, JBE 169
Office Hours: W 1045-1140am BE 173, or by appointment x9-2195
Course topics: Theory and practice of encryption and decryption.
Classic ciphers.
Texts: Yellin, course notes; Barr, Invitation to Cryptology,
Prentice-Hall 2002
Background reading: Levy, Crypto, Penguin, 2001;
Singh, The Code Book, Anchor, 1999;
Kahn, The Codebreakers, Scribner,
1996.
Required
prerequisite material is taught in the following courses: Calculus (MA19),
linear algebra (MA21), discrete mathematics (CE16), AMS 27.
1. Introduction: Cryptography and Information Theory.
2.
Shannon Entropy, measuring information
3.
Classical ciphers: Transposition, substitution, statistics of plaintexts.
4.
Reading:
Class Notes, pp.31-40.
5. Stream
and Block Encoding, S-DES, DES.
6. Cryptographic
tools: probabilistic algorithms, modular arithmetic, algorithmic number theory.
7. Public
key systems: Diffie-Hellman, RSA, knapsack algorithms, discrete logs.
8.
Elliptic Curve Cryptography
9.
Message integrity and authentication: Digital signing, hash functions.
10.
Quantum computation and cryptography: qubits, measurement and authentication,
quantum algorithms.
Evaluation
of performance: midterm(s), final examination, crypto project, class quizzes.
Last
day of class: 12/1. Holidays: 11/12,
11/22-23. Final Examination: Wed 12/12, 4-7pm.