Programme/Approved Electives for 2019/20
Mathematics Combined Honours (Level 6)
Available as a Free Standing Elective
MAT-20025 Abstract Algebra.
This module aims to introduce students to Number Theory, which is one of the oldest and most beautiful branches of Pure Mathematics, and also illustrate how some concepts from Number Theory have had unexpected applications to modern problems in cryptography.
Intended Learning Outcomes
evaluate different approaches to linear congruence to determine a full list of solutions, or provide a mathematical proof that none exist: 1,2,state and prove the Chinese Remainder Theorem, and apply it to solve problems involving systems of simultaneous linear congruences: 1,2,state the definition of a Primitive Root modulo a natural number, and apply this definition to solve theoretical problems concerning the enumeration and properties of primitive roots: 1,2,define Quadratic Residues and Legendre Symbols and, by stating, proving and applying suitable theorems, compute Legendre symbols in a variety of cases: 1,2,explain and evaluate the construction and properties of a variety of ciphers, including symmetric and asymmetric (public key) systems: 1,2,appraise the strengths and weaknesses of different cryptography systems, and make judgements on appropriate side-channel attacks to attack poorly implemented systems: 1,2,
Lectures and Examples Classes: 36 HoursPreparation of Coursework: 24 Hours Independent Study: 88 HoursUnseen examination : 2 hours
1: Unseen Exam weighted 70%
Description of Module Assessment
2-hour unseen examinationThe examination paper will consist of no less than five and not more than eight questions all of which are compulsory.2: Exercise weighted 30%
Continual AssessmentContinuous assessment will consist of written coursework, problem sheets, class tests, or any combination thereof.