3.00 Credits
Introduction to a selection of topics from the related fields of Number Theory and Cryptography. Topics may include congruence arithmetic, primitive roots, quadratic residues, perfect numbers, Pythagorean triples, sums of squares, Fermat's Last Theorem, and primality testing, various substitution ciphers including affine, Vigenere, and Hill ciphers and the RSA public key encryption system with several variations. Algorithms for each encryption scheme discussed will be introduced and implemented. This class is available for graduate credit.
Prerequisite:
MAT 320 FOR LEVEL U WITH MIN. GRADE OF D OR GPRE FOR MIN. SCORE OF 1