MA30364: Number theory and cryptography
[Page last updated: 22 May 2025]
Academic Year: | 2025/26 |
Owning Department/School: | Department of Mathematical Sciences |
Credits: | 6 [equivalent to 12 CATS credits] |
Notional Study Hours: | 120 |
Level: | Honours (FHEQ level 6) |
Period: |
|
Assessment Summary: | EXCB 100% |
Assessment Detail: |
|
Supplementary Assessment: |
|
Requisites: |
Before taking this module you must take MA12004 OR take MA12011 OR take MA12013 OR take MA10210
In taking this module you cannot take MA40238 |
Learning Outcomes: |
By the end of this unit, you will be able to:
芒锟铰olve problems involving elementary number theory.
芒锟铰emonstrate understanding in a range of more advanced topics in number theory. |
Synopsis: | Number theory concerns the study of the whole numbers and is one of the oldest areas of mathematics. It is a subject that can trace its history back to antiquity and has in modern times found spectacular applications to coding theory and cryptography. You will cover some of the great topics in elementary number theory and explore some of its applications. |
Content: | Elementary number theory, congruences, Chinese Remainder Theorem, Euler phi function, Mobius inversion, prime number theory, perfect numbers, Mersenne primes, Fermat primes, Carmichael numbers, RSA cryptography, Diffie-Hellman key exchange, discrete logarithm problem, quadratic residues, The quadratic reciprocity theorem. Further topics to be taken from: continued fractions, Diophantine equations, quadratic forms, Cryptography, and error correcting codes. |
Course availability: |
MA30364 is Optional on the following courses:Department of Mathematical Sciences
|
Notes:
|