MATH 3809
Introduction to Number Theory and Cryptography
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.
2021
Topics
- Introduction to the course. Divisibility.
- GCD and LCM. Euclidean algorithm.
- Modular arithmetic. Modular inverses.
- Classical cryptosystems.
- Classical cryptosystems (cont). Cryptanalysis.
Readings
- Romero, 1998; (2) A Friendly Introduction to Number Theory by Joseph Sil- verman, 4th edition, 2013; and (3) Cryptography: Theory and Practice by Douglas Stinson and Maura Paterson, 4th edition, 2018.
Prerequisites & course information
Prerequisite(s): MATH 2108 or MATH 3101 or MATH 2100 ; knowledge of a computer language. Lectures three hours a week and one hour tutorial.
Sources
- Course catalogue ↗2026–2027
- MATH 3809A F21 ↗2021