Cryptology and Computational Number Theory Recognizing prime numbers, factoring composite numbers, finite fields, elliptic curves, discrete logarithms, private key cryptology, key exchange systems, signature authentication, public key cryptology. Credit Hours: 3 Prerequisites: MATH 4000/6000 Level: Graduate Undergraduate
