Skip to main content
 

MATH3401: CRYPTOGRAPHY AND CODES III

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 20
Availability Available in 2023/24
Module Cap
Location Durham
Department Mathematical Sciences

Prerequisites

  • Elementary Number Theory II (MATH2617)

Corequisites

  • None.

Excluded Combinations of Modules

  • Codes and Cryptography (COMPNEW3X41).

Aims

  • To give a basic introduction to two topics in data transfer which rely on abstract mathematics:Error correcting Codes which are used widely in data transmission over noisy channels, Cryptography which is widely used in banking, internet browsing, and to ensure privacy on mobile networks.

Content

  • Introduction to codes: The Hamming distance, Error detection and correction, equivalence of codes
  • Linear Codes, Dual codes and Decoding Methods
  • Hamming Codes, Golay Codes,
  • Linear Codes over cyclic fields, Cyclic Codes, BCH codes, Reed-Solomon Codes
  • Introduction to open-key cryptography, notion of trapdoor function. The factorisation and discrete logarithm problems
  • Diffie-Hellman key exchange scheme. RSA cryptosystem
  • Elliptic curves over rational numbers and finite fields, Elliptic Curve Diffie-Hellman scheme
  • Lenstra factoring algorithm

Learning Outcomes

Subject-specific Knowledge:

  • By the end of the module students will: be able to solve a range of predictable and unpredictable problems in Cryptography and Codes.
  • have an awareness of the abstract concepts of theoretical mathematics in Codes and Cryptography.
  • have a knowledge and understanding of fundamental theories of these subjects demonstrated through one or more of the following topic areas:
  • Codes: Linear, Hamming, Cyclic, BCH, Reed-Solomon Codes
  • Cryptography: open-key systems
  • Elliptic curves, applications in cryptography.

Subject-specific Skills:

  • In addition students will have specialised mathematicalskills in the following areas which can be used in minimal guidance:Abstract Reasoning.

Key Skills:

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

  • Lectures demonstrate what is required to be learned and theapplication of the theory to practical examples.
  • Assignments for self-study develop problem-solving skills andenable students to test and develop their knowledge andunderstanding.
  • Formatively assessed assignments provide practice in theapplication of logic and high level of rigour as well as feedback forthe students and the lecturer on students' progress.
  • The end-of-year examination assesses the knowledge acquiredand the ability to solve predictable and unpredictableproblems.

Teaching Methods and Learning Hours

ActivityNumberFrequencyDurationTotalMonitored
Lectures422 per week for 20 weeks and 2 in term 31 Hour42 
Problems Classes8Four in each of terms 1 and 21 Hour8 
Preparation and Reading150 
Total200 

Summative Assessment

Component: ExaminationComponent Weighting: 100%
ElementLength / DurationElement WeightingResit Opportunity
Written examination3 Hours100 

Formative Assessment

Eight written assignments to be assessed and returned. Other assignments are set for self-study and complete solutions are made available to students.

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.