October Lectures

Week of October 1-5

Oct 2: Exemplos of the Euclidean algorithm. Linear Diophantine equations.
Oct 4: Congruences.
Tutorial: No tutorial.

Week of October 8-12

Oct 9: Modular inverses. Comments about midterm test #1 and assignment #1.
Oct 11: Modular inverses (cont). Chinese remainder theorem.
Tutorial: Exercises: linear Diophantine equations, congruences and Chinese remainder theorem.

Week of October 15-19

Oct 16: Chinese remainder theorem (cont). Fermat's theorem.
Oct 18: Midterm test #1. [A1 handed in.]
Tutorial: Polynomial congruences and Lagrange's theorem.

Week of October 22-26

Oct 23: Euler's Phi function. Euler's theorem.
Oct 25: Classical cryptosystems.
Tutorial: Solutions of Test #1. Modular exponentiation.

Week of October 29 - November 2

Oct 30: Public-Key cryptography. The RSA scheme.
Nov 1: Pseudoprimes and Carmichel numbers. [A2 handed out.]
Tutorial: Solutions of Assignment #1. Exercises: cryptography and RSA.

To September lectures.
To November lectures.