Module Search

COMP3697: Cryptography

Please ensure you check the module availability box for each module outline, as not all modules will run in each academic year. Each module description relates to the year indicated in the module availability box, and this may change from year to year, due to, for example: changing staff expertise, disciplinary developments, the requirements of external bodies and partners, and student feedback. Current modules are subject to change in light of the ongoing disruption caused by Covid-19.

Type	Open
Level	3
Credits	10
Availability	Available in 2023/24
Module Cap	None.
Location	Durham
Department	Computer Science

Prerequisites

(COMP1021 Mathematics for Computer Science OR MATH1561 Single Mathematics A OR MATH1071 Linear Algebra I) AND COMP1051 Computational Thinking

Corequisites

None

Excluded Combinations of Modules

MATH3401 Cryptography and Codes III

Aims

To understand:
the main cryptographic primitives for secret-key and public-key cryptography;
the main security notions for cryptosystems;
the main kinds of attacks to protect against when using a cryptosystem.

Content

Introduction to cryptography
Secret-key cryptography: DES, AES, modes of operation, and attacks against those systems
Public-key cryptography: RSA and attacks against it
Discrete-logarithm and Elliptic Curve cryptography and attacks against those
Lattice-based cryptography
Side-channel attacks

Learning Outcomes

Subject-specific Knowledge:

On completion of the module, students will be able to demonstrate:
an understanding of the key features of secret-key and public-key cryptography primitives;
an understanding of security concerns for cryptography;
an understanding of the main kind of attacks against cryptosystems.

Subject-specific Skills:

On completion of the module, students will be able to demonstrate:
an ability to design and use main cryptography primitives;
an ability to run different kinds of attacks against cryptosystems.

Key Skills:

On completion of the module, students will be able to demonstrate:
an ability to validate the correctness and security of cryptosystems;
an ability to conduct some attacks against those cryptosystems.

Modes of Teaching, Learning and Assessment and how these contribute to the learning outcomes of the module

Lectures enable the students to learn new material relevant to cryptography.
Practical session enable students to practice running complex attacks against symmetric-key cryptosystems.
The summative assessment assesses the knowledge and understanding of the cryptosystems and the attacks viewed throughout the course.

Teaching Methods and Learning Hours

Activity	Number	Frequency	Duration	Total
Lectures	20	2 per week	1 hour	20
Practicals	1		2 hours	2
Preparation and reading				78
Total				100

Summative Assessment

Component: Coursework		Component Weighting: 100%
Element	Length / Duration	Element Weighting	Resit Opportunity
Assignment		100	No

Formative Assessment

Example formative exercises are given during the course.

More information

If you have a question about Durham's modular degree programmes, please visit our FAQ webpages, Help page or our glossary of terms. If you have a question about modular programmes that is not covered by the FAQ, or a query about the on-line Undergraduate Module Handbook, please contact us.

Prospective Students: If you have a query about a specific module or degree programme, please Ask Us.

Current Students: Please contact your department.