Basic Tools for Coding theory and Cryptography

Postgraduate course

Course description

Objectives and Content


The aim of the course is to provide a basis for advanced courses in coding theory and cryptography, as well as for a master project in these areas.


The course covers a collection of concepts and theoretical results, bounds, and techniques essential for carrying out advanced studies and research in the areas of coding theory and cryptology. Among these topics are

  • Finite fields with applications to design of error correcting codes and to cryptographic primitives
  • Linear feedback shift registers
  • Boolean functions with applications in cryptography and coding theory

Learning Outcomes

On completion of the course the student should have the following learning outcomes defined in terms of knowledge, skills and general competence:


The student should have knowledge of

  • finite fields theory used in cryptography and coding theory, including linear feedback shift registers
  • basics of Boolean functions and their applications to cryptography
  • basics of linear recurrent sequences and feedback shift registers
  • basics of linear and cyclic codes


The student is able to

  • create computer programs using the concepts, data structures, and algorithms covered in the course
  • explain and create proofs in coding theory and cryptography

General competence:

The students

  • are familiar with mathematical foundations for cryptography and coding theory,
  • can exchange opinions with others with relevant background and participate in discussions concerning the subject.

ECTS Credits


Level of Study

Bachelor / Master / PhD

Semester of Instruction

Required Previous Knowledge
At least 60 ECTS in computer science, preferably including basic knowledge in discrete mathematics
Recommended Previous Knowledge
Credit Reduction due to Course Overlap
I145: 10 SP
Access to the Course
Access to the course requires admission to a programme of study at The Faculty of Mathematics and Natural Sciences
Teaching and learning methods

The teaching comprises lectures and group exercises.

Lectures: 2 hours pr. week
Group exercises: 4 hours pr. week

Compulsory Assignments and Attendance
Compulsory assignments are valid for one subsequent semester.
Forms of Assessment
Digital written examination (3 hours).
Compulsory exercises may count towards the final grade.
Grading Scale
The grading scale used is A to F. Grade A is the highest passing grade in the grading scale, grade F is a fail.
Assessment Semester
Examination both spring semester and autumn semester. In semesters without teaching the examination will be arranged at the beginning of the semester.
Reading List
The reading list will be available within July 1st for the autumn semester and December 1st for the spring semester
Course Evaluation
The reading list will be available within June 1st for the autumn semester and January 1st for the spring semester
Examination Support Material
Non-programmable calculator, according to the faculty regulations
Programme Committee
The Programme Committee is responsible for the content, structure and quality of the study programme and courses.
Course Coordinator
Course coordinator and administrative contact person can be found on Mitt UiB, or contact Student adviser
Course Administrator
The Faculty of Mathematics and Natural Sciences represented by the Department of Informatics is the course administrator for the course and study programme.