ECS 227: Modern Cryptography

ECS 227
Modern Cryptography
Effective Term
2016 Spring Quarter
Learning Activities
Lecture - 3.0 hours
Discussion - 1.0 hours
Modern cryptography as a discipline emphasizing formal definitions and proofs of security. One-way functions, pseudo-randomness, encryption, digital signatures, zero-knowledge, secure protocols.
ECS 220 or ECS 222A
Enrollment Restrictions
Pass One and Pass Two open to Graduate Students in Computer Science only.

Summary of Course Content
I. Overview. Sample cryptographic goals. The idea of provable security. Resources of cryptographic interest.

II. Block ciphers, pseudorandom function families, and pseudorandom permutation families.

III. Pseudorandom generators and one-way functions. Hard-core bits.

IV. Symmetric encryption: realizations and notions of security.

V. Asymmetric encryption. Number-theoretic background. The random-oracle paradigm.

VI. Message authentication. Connections to universal hashing.

VII. Digital signatures.

VIII. Uniform and non-uniform security. Asymptotic approaches.

IX. Interactive proofs. IP=PSPACE. Zero-knowledge. NP in zero-knowledge. Non-interactive zero-knowledge.

X. Entity authentication and session-key distribution.

XI. Secret-sharing schemes. Verifiable secret sharing. Key escrow.

XII. Secure function evaluation.

Computer Usage:


ABET Category Content:

Engineering Science: 4 units
Engineering Design: 0 unit

Illustrative Reading
None; distributed lecture notes and selected papers from the literature.

Potential Course Overlap
This course does not have a significant overlap with any other course. Some classical cryptography (eg., RSA encryption) is covered in ECS 235, but that course has a very different emphasis, with no definitions or proofs.

Course Category