Divisibility and the Division Algorithm, Modular Arithmetic, the Euclidean Algorithm, Fermat’s and Euler’s Theorems, Prime Numbers, Testing for Primality, the Chinese Remainder Theorem, Discrete Logarithms and primitive roots. Finite Fields: Groups, Rings, and Fields, Finite Fields of the Form GF(p), Finite Fields of the Form GF(2n), Polynomial Arithmetic, Elliptic Curves over Zp, and Elliptic Curves over GF(2n). Lattices and hard Lattice problems.
Parent Business Unit ID:
Prerequisite:
COMP233 | DISCRETE MATHEMATICS
