MRes Advanced Computer Science MRes
Year of entry: 2018
Course unit details:
|Unit level||FHEQ level 7 – master's degree or fourth year of an integrated master's degree|
|Teaching period(s)||Semester 1|
|Offered by||School of Computer Science|
|Available as a free choice unit?||Yes|
The course aims to give students a good appreciation of cryptographic techniques, as they have arisen historically, and as they are used today.
Learning outcomes are detailed on the COMP61411 course unit syllabus page on the School of Computer Science's website for current students.
- Early cryptography: permutations and substitutions, Vignere, Vernam, one time pads, etc.
- Rotor machines: Enigma and its relatives.
- Case study: Marian Rejewski and the breaking of the German Enigma.
- Modern cryptography, secret key: block cyphers, DES, AES, etc.
- Modern cryptography, public key: Diffie-Hellman, RSA, elliptic curves.
- Message authentication, hash functions.
- Quantum cryptography: quantum key distribution in practice.
- Analytical skills
- Problem solving
|Written assignment (inc essay)||40%|
COMP61411 reading list can be found on the School of Computer Science website for current students.
|Scheduled activity hours|
|Assessment written exam||2|
|Practical classes & workshops||15|
|Independent study hours|
|Richard Banach||Unit coordinator|
Course unit materials
Links to course unit teaching materials can be found on the School of Computer Science website for current students.