MATH 346 | Cryptography

This course covers various cryptosystems and the number theory required to understand them. Topics include substitution ciphers, the Viegenere cipher, public-key cryptography, RSA, modular arithmetic, the Extended Euclidean algorithm, and Fermat’s Little Theorem. Additional topics may include the Diffie-Hellman cryptosystem, the knapsack cryptosystem, the infinitude of primes, and techniques for finding large primes.