COMP3063 - Introduction to Cryptography
This database contains 2017-18 versions of the syllabuses. For current versions please see here.
|Code||COMP3063 (Also taught as: COMPGA03 and COMPM063)|
|Prerequisites||Successful completion of years 1 and 2 of MEng Mathematical Computation|
|Taught By||Emiliano De Cristofaro (100%) |
|Aims||For many centuries the goal of cryptography was the protection of privacy of communications. Computers, digital communication and in particular the internet have brought an abundance of new security goals. Examples are: anonymity, authenticity, non-repudiation, authorized wiretapping (called law enforcement), and traceability. To each need corresponds security mechanisms to achieve it. The goal of the course is to make students familiar with such techniques and some of the foundations of these methods. In particular students will be confronted with a range of security objectives, different levels of security that can be achieved and some available cryptographic techniques that can be used.|
|Learning Outcomes||Students start learning how to think from an adversarial viewpoint. The goal is to become familiar with basic techniques to protect data in computer and communication environments against several different varieties of fraud.|
Cryptanalysis of classical ciphers
Block cipher modes of operation
Chosen plaintext attacks
Chosen cyphertext attacks
Message authentication codes
CCA-secure private-key encryption
2nd pre-image resistance
Key distribution centres
Modular arithmetic and group theory
Diffie-Hellman key exchange
Discrete logarithm problem
RSA-FDH and RSA-PSS signatures
Method of Instruction
Tutor-led class sessions, problem-solving sessions and private study
The course has the following assessment components:
- Coursework Section (Three or four Exercise Assignments, 35%);
- Written Examination (2.5 hours, 65%).
To pass this course, students must:
- Obtain an overall pass mark of 40% for all components combined;
- Obtain a minimum mark of 30% in each component worth ≥ 30% of the module as a whole.
Reading list available via the UCL Library catalogue.