Unit name | Cryptography B |
---|---|
Unit code | COMSM0007 |
Credit points | 10 |
Level of study | M/7 |
Teaching block(s) |
Teaching Block 1 (weeks 1 - 12) |
Unit director | Dr. Stam |
Open unit status | Not open |
Pre-requisites | |
Co-requisites |
None |
School/department | Department of Computer Science |
Faculty | Faculty of Engineering |
This unit builds on the foundations layed in Cryptography A where the basic primitives for authentication and secrecy have been introduced. This follow-up course deals with more advanced topics, specific to modern cryptographic research. The broad range of topics range from foundational questions (what are minimal, sufficient conditions for cryptography to even exist?) to practical ones (how to design and analyze e-voting systems).
A common view of cryptography is that it only focuses on schemes for encryption; this unit aims to introduce an extended remit of advanced techniques and primitives that allow cryptographic solutions to numerous real-world problems.
The syllabus will include aspects of (but is not limited to):
- Foundations and primitives: pseudo-random generators, functions and permutations, hard-core bits; hash function preimage and collision resistance.On successful completion of this unit you will be able to:
20 hours of lectures (2 hours per week).
30% via coursework assignment(s) and in-class "quiz", 70% via examination.
The coursework assignment(s) for this unit are intended to represent in depth, self-directed learning relating to one or more state-of-the-art topics in cryptography; assessment is via a written report and/or oral presentation.