Overview
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.
Offerings
S2-01-CLAYTON-ON-CAMPUS
Rules
Enrolment Rule
Contacts
Chief Examiner(s)
Professor Ian Wanless
Unit Coordinator(s)
Professor Ian Wanless
Notes
This unit shares lectures and applied classes with MTH3137, but has separate assessment.
Teaching approach
Active learning
Assessment
1 - Continuous assessment
2 - Final assessment - Exam (3 hours and 10 minutes)
Scheduled and non-scheduled teaching activities
Applied sessions
Seminars
Workload requirements
Workload
Availability in areas of study
Mathematics
Pure mathematics
Applied mathematics
Statistics
Computer science (pending FIT approval).
Pure mathematics
Applied mathematics
Statistics
Computer science (pending FIT approval).