Review of basic algorithms and complexity. Symmetric key cryptography. Discrete log based cryptography. One-way functions and Hash functions. Knapsack. Introduction to primality testing. Factoring. Other topics may include elliptic curves, zero-knowledge, and quantum cryptography.
This course may not be repeated for credit.
Prerequisite(s)
- Pure Mathematics 321 or 329 and Pure Mathematics 427
Sections
This course will be offered next in
Winter 2009.