The goal of this course is to use modern public-key cryptography as a vehicle for learning various important concepts in advanced mathematics. Topics will include Diffie-Hellman key exchange, RSA cryptosystem, NTRU cryptosystem, elliptic curve cryptography, discrete logs, DES and AES, digital signatures, hash functions, error correcting codes and quantum cryptography. To understand these ideas, we will need to study ring theory, probability, number theory over a finite field, elliptic curves, linear algebra of lattices, and NP-Completeness. There will also be a computational component to the course - encryption, decryption, and attacks on cryptosystems using a computer.

Units: 1

Max Enrollment: 15

Prerequisites: MATH 305 or permission of the instructor.

Distribution Requirements: MM - Mathematical Modeling and Problem Solving

Typical Periods Offered: Every other year; Spring

Semesters Offered this Academic Year: Spring