Topics include: Euclid's algorithm, unique factorization moduli arithmetic, Fermat's and Euler's theorems, Chinese remainder theorem, RSA public key encryption, Pollard rho factoring, pseudo primes, error correcting codes, Hamming codes, polynomial rings and quotient rings, field extensions, finite fields and BCH codes.
Prefix:
MA
Course Number:
340

Semester:
Spring 2017
Year:
2017030
Credits:
3.0