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 MTH2137, but has separate (more advanced) assessment.

Teaching approach

Active learning

Assessment

1 - Continuous assessment
2 - Examination (3 hours and 10 minutes)

Scheduled and non-scheduled teaching activities

Applied sessions
Lectures

Workload requirements

Workload

Availability in areas of study

Mathematics
Pure mathematics
Applied mathematics
Statistics
Computer Science (pending FIT approval)