The basics of cryptography, with emphasis on attaining well-defined and practical notions of security. Symmetric and public-key cryptosystems; one-way and trapdoor functions; mechanisms for data integrity; digital signatures; key management; applications to the design of cryptographic systems. Assessment will primarily focus on mathematical theory and proof-oriented homework problems; additional application programming exercises will be available for extra credit.
This course may not be repeated for credit.
Notes
- Lectures may run concurrently with Computer Science 418.
Prerequisite(s)
- One of Mathematics 271 or 273, or Pure Mathematics 315 or 317.
Antirequisite(s)
- Credit for both Pure Mathematics 418 and any of Pure Mathematics 329, Computer Science 418, 429, or 557 will not be allowed.
SyllabusSections