Congruences, distribution of primes, general cryptographic systems, public key cryptographic systems and authentification using number theory, primality testing and factoring in relation to cryptography, continued fractions and Diophantine equations. Prerequisite(s): MATH 2108 or MATH 3101 or MATH 2100; knowledge of a computer language. Lectures three hours a week and one hour tutorial. [0.5 credits]
Congruences, distribution of primes, general cryptographic systems, public key cryptographic systems and authentification using number theory, primality testing and factoring in relation to cryptography, continued fractions and Diophantine equations. Prerequisite(s): MATH 2108 or MATH 3101 or MATH 2100; knowledge of a computer language. Lectures three hours a week and one hour tutorial. [0.5 credits]
