Show/hide contentOpenClose All
Curricular information is subject to change
On completion of this module, the student should have acquired an understanding of the mathematical underpinnings of relevant information security algorithms and techniques.
Indicative Module Content:- Fundamentals of cryptography. Mathematical definitions of secrecy.
- Fundamentals of number theory.
- RSA cryptography and factoring of large numbers.
- Computation of discrete logarithms. key exchange methods, cryptosystems and digital signature algorithms based on the discrete logarithm problem.
- Elliptic-curve cryptosystems.
- Digital data hiding. Forensics and counterforensics.
Student Effort Type | Hours |
---|---|
Lectures | 20 |
Autonomous Student Learning | 80 |
Total | 100 |
The student must be familiar with the fundamentals of probability theory.
Learning Recommendations:It is recommended, but not mandatory, that the student has taken COMP30960 (Information Theory).
Description | Timing | Component Scale | % of Final Grade | ||
---|---|---|---|---|---|
Assignment(Including Essay): Assignments | n/a | Alternative linear conversion grade scale 40% | No | 100 |
Resit In | Terminal Exam |
---|---|
Autumn | No |
• Feedback individually to students, post-assessment
Feedback provided through the VLE.