MATH 3540: Introduction to Cryptography (3)
Lecture: 3, Lab: 0, Other: 0
This course is an introduction to the mathematics used in both cryptology and cryptanalysis. Among the topics included in the course are the difficulty of an algorithm in terms of polynomial time; number theory topics such as divisibility, greatest common divisor, the Euclidian Algorithm, prime numbers, congruence, Fermat's little theorem, factoring, discrete logarithms; encryption schemes and the associated matrices or linear maps; perfect security; the DES algorithm; public-key encryption; digital signatures. The ability to read mathematical proofs will be expected. Pre-requisite: MATH 2460 with a grade of C or better