MTH2137 · Monash University
Number theory and cryptography
- Credit points
- 6
- Level
- 2
- Workload
- —
- Faculty
- Science
What it covers
Prime numbers; Euclidean algorithm; congruences; the Euler totient function; the theorems of Fermat, Euler and Wilson; RSA public key cryptosystem; Chinese remainder theorem; quadratic reciprocity; primitive roots; factorisation and primality testing algorithms; secure key exchange; elliptic curve cryptography.
Assessment
| Task | Type | Weight |
|---|---|---|
| Continuous assessment | Demonstration | 50% |
| Final assessment - Exam (3 hours and 10 minutes) | Examination | 50% |
When and where
| Teaching period | Campus | Mode |
|---|---|---|
| Second semester | Clayton | On-campus |