Kaisa_2012_3_photo by Veikko Somerpuro

Anmäl dig
22.5.2019 kl. 09:00 - 16.6.2019 kl. 23:59



Master's Programme in Computer Science is responsible for the course.

The course belongs to Security module.

The course is available to students from other degree programmes.

Basic university mathematics course.

Basic university-level course in networking.

Cyber Security

The student learns most important cryptographic concepts and relevant mechanisms that are used in realizing those concepts. Examples of these concepts are symmetric ciphers, public-key encryption, digital signatures, message authentication codes and has functions. Student also learns basic mathematical tools that are used as building blocks in cryptographic mechanisms. The student becomes able to apply mathematics for the purposes of cryptography. More advanced cryptographic primitives are also learnt at least on conceptual level. Such primitives include protocols for e.g. zero-knowledge proofs, secret sharing and multipart computations. The student learns how to apply cryptographic tools for information security and privacy, especially in the domain of networking. Mobile communication and block chains are examples of application areas that the student becomes familar with.

First year of Master's studies

Every year, Autumn period I

Basics of cryptography

Mathematical tools

Symmetric ciphers:

AES, differential and linear cryptanalysis, block cipher modes, random number generators, stream ciphers, cryptanalysis against stream ciphers

Public-key encryption:

RSA, side channel attacks, quantum computer attacks

Digital signatures:

Hash functions, certificates, PKI

Systems based on discrete logarithms:

Diffie-Hellman key exchange, Man-in-the-middle attacks, One-time pad, ElGamal, Elliptic Curve Cryptography

Cryptographic protocols:

Key establishment, attacks, design principles

Special protocols:

Secret sharing, Bitcoin, Zero-knowledge proofs, Oblivious transfer, Secure multiparty computation, Authenticated encryption

Communication security:


Cryptography for mobile security:

GSM, 3G, LTE, 5G, WiFi, Bluetooth

Lecture slides are distributed in the wiki page of the course.

Student attends lectures, solves exercise problems and presents solutions.

Lecture slides are collected to the wiki page.

Exam includes 4-5 problems each of equal weight. Completion of exercises provides bonus points worth 0-20 % of exam points.

Erilliskokeiden luetteloissa käytetään seuraavia merkintöjä: (U): Koe on (ensimmäinen kurssia seuraava) erilliskoe ja samalla kurssikokeen/kurssikokeiden uusintakoe. Uusintakoesuorituksessa harjoituspisteet tms. otetaan huomioon. (HT): Kokeeseen voivat osallistua vain ne, jotka ovat suorittaneet kurssiin kuuluvat pakolliset harjoitustyöt (tms.). (HT/U): Kuten (U), mutta osallistumisoikeus on rajoitettu HT-kokeen tapaan. (ei erityismerkintää): Koe on erilliskoe; osallistumista ei ole rajoitettu, mutta kurssin vaatimat esitiedot on syytä ottaa huomioon.

Contact teaching.

Student has to complete 25% of the exercise problems to qualify to the exam.

Exam in the end of the course.

Completion of good portion of exercise problems provides bonus points in the exam. Completion of 25% provides 0 bonus points while completion of 90% provides bonus points worth of 20% of points available in the exam.

Valtteri Niemi