MonMap
A course mapper by Monash Association of Coding (MAC)
Number theory and cryptography
MTH2137
Synopsis
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.
Sourced from the Monash Handbook 2026.
Quick facts
- Credit points
- 6
- Level
- 2
- Audience
- Undergraduate
- Type
- Coursework
- School
- Faculty of Science
- Faculty
- School of Mathematics
- Handbook year
- 2026
Prerequisites (7)
- Advanced engineering mathematicsENG2005
- Algorithms and data structuresFIT2004
- Theory of computationFIT2014
- Linear algebra with applicationsMTH2021
- Linear algebra (Advanced)MTH2025
- Algebra 1: Group theoryMTH2141
- Algebra 1: Group theoryMTH3141
What it unlocks (2)
- Algebra 1: Group theoryMTH3141
- Network mathematicsMTH3170
Offerings (1)
- Second semesterClayton · ON-CAMPUS
Listed in 7 areas of study
- Applied mathematicsAdditional elective unit
- MathematicsMathematics elective unit
- MathematicsMathematics elective units
- MathematicsMathematics elective units
- Pure mathematicsPure mathematics elective units
- Pure mathematicsPure mathematics elective units
- Mathematical statisticsAdditional elective units