Entry requirements

120 credits including a second course in programming, Algorithms and Data Structures, Algebra I and Linear Algebra. Proficiency in English equivalent to the Swedish upper secondary course English 6.

Learning outcomes

On completion of the course, the student shall be able to:

• give examples of how theories, principles, and techniques based on cryptology can be used to achieve data security.
• explain the theories underpinning common cryptographic methods, such as different types of hash-functions, symmetric and asymmetric ciphers, digital signatures and random numbers.
• analyse, use and implement such methods and reflect on their limits and applicability.

Content

Theory and practice of different forms of ciphers, e.g. classical, block, flow, affine, and public. Hash-functions with and without keys, handling of keys, random numbers.

Instruction

Lecture, labs and seminars.

Assessment

Written exam and oral and written reports.

If there are special reasons for doing so, an examiner may make an exception from the method of assessment indicated and allow a student to be assessed by another method. An example of special reasons might be a certificate regarding special pedagogical support from the disability coordinator of the university.