| # |
WEEK OF |
~ |
SECTIONS |
TOPICS |
| ~ |
Sep 10
|
~ |
2.1 |
An overview of the course. Divisibility. |
| 1 |
Sep 14-18 |
~ |
2.1-2.2 |
Divisibility. Primes. |
| 2 |
Sep 21-25 |
~ |
2.3-2.4 |
Unique factorization. Elementary factoring
methods. |
| 3 |
Sep 28 - Oct 2 |
~ |
2.5-2.6 |
GCD and LCM. Linear Diophantine equations. |
| 4 |
Oct 5-9 |
assg. 1 handed-out |
3.1-3.3 |
Congruences. Inverses mod p. Chinese remainder
theorem. |
| 5 |
Oct 12-16 |
~ |
4.1-4.4 |
Fermat's theorem. Euler's Phi function. Euler's
theorem. Lagrange's theorem. |
| 6 |
Oct 19-23 |
midterm 1 |
5.1 |
Classical cryptosystems. |
| 7 |
Oct 26-30 |
assg. 1 due |
5.2-5.3 |
Public-Key cryptography. The RSA scheme. |
| 8 |
Nov 2-6
|
~ |
6.1, 6.3-6.4 |
Pseudoprimes and Carmichel numbers. Pollard's
p-1 and rho factorization methods. |
| 9 |
Nov 9-13 |
~ |
7.1-7.4 |
Order. Discrete logarithm. Lucas-Lehmer test. |
| 10 |
Nov 16-20 |
midterm 2 |
8.1, 10.1 |
ElGamal cryptosystem. Identification schemes. |
| 11 |
Nov 23-27 |
~ |
8.2, 9.1 |
Signature schemes. Quadratic residues. |
| 12 |
Nov 30 - Dec 4
|
~ |
17.1-17.3 or 12.2 |
Quadratic reciprocity law or quadratic sieve.
Review. |