MTHE 418 Number Theory & Cryptography Units: 3.00
Time estimates for arithmetic and elementary number theory algorithms (division algorithm, Euclidean algorithm, congruences), modular arithmetic, finite fields, quadratic residues. Simple cryptographic systems; public key, RSA. Primality and factoring: pseudoprimes, Pollard's rho-method, index calculus. Elliptic curve cryptography.
NOT OFFERED 2024-2025.
(Lec: 3, Lab: 0, Tut: 0)
NOT OFFERED 2024-2025.
(Lec: 3, Lab: 0, Tut: 0)
Requirements: Prerequisites: MTHE 217 (MATH 217) or MATH 210 or MATH 211 with permission of the instructor
Corequisites:
Exclusions:
Offering Term: W
CEAB Units:
Mathematics 18
Natural Sciences 0
Complementary Studies 0
Engineering Science 9
Engineering Design 9
Offering Faculty: Faculty of Arts and Science
Course Learning Outcomes:
- Computations and constructions in finite fields.
- Reasoning on elliptic curves.
- Understanding of the algebraic structure of a group.
- Rigorously proving results in number theory.
- Probability analysis of primality tests.
- Analysis of cryptographic protocols.
- Designing a cryptographic system with given real-world parameters.
- Testing various designs to determine which performs the best.