Unit name | Cryptography A |
---|---|
Unit code | COMS30002 |
Credit points | 10 |
Level of study | H/6 |
Teaching block(s) |
Teaching Block 1 (weeks 1 - 12) |
Unit director | Dr. Stam |
Open unit status | Not open |
Pre-requisites |
COMS20002 or a comparable background in discrete mathematics |
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):
On successful completion of this unit you will be able to:
20 hours of lectures (2 hours per week), 10 hours of (supervised, but non-taught) problem classes (1 hour per week).
30% via a coursework assignment, 70% via examination
J. Katz and Y. Lindell. Introduction to Modern Cryptography. Chapman & Hall/CRC, 2011. ISBN: 1584885513.