Cryptology
Study plans 2016-2017 - IMT4124 - 7.5 ECTS

On the basis of

It is desirable to have at least minimal previous level of knowledge in cryptology (for example, by passing the course IMT4113 Introduction to Cyber and Information Security Technology or equivalent.), since this course introduces some advanced topics in cryptology.

Expected learning outcomes

Knowledge:

  • Possesses advanced knowledge in generating primitive feedback polynomials for application in stream ciphers based on linear feedback shift registers, design of pseudorandom sequence generators based on non-linear combiners and non-uniform decimation of sequences, algebraic and correlation attacks on stream ciphers, constructing highly non-linear S-boxes for application in block ciphers based on differential k-uniform mappings, linear and differential cryptanalysis of block ciphers, primality testing, factoring large integers, discrete logarithm, and elliptic curves, hash function construction methods and security analysis, and various digital signature schemes (RSA, ElGamal, etc.)
  • Possesses thorough knowledge about theory and scientific methods relevant for cryptology.
  • Is capable of applying his/her knowledge in new fields of cryptology.

 

Skills:

  • Is capable of analyzing existing theories, methods and interpretations in the field of cryptology and working independently on solving theoretical and practical problems.
  • Can use relevant scientific methods in independent research and development in cryptology
  • Is capable of performing critical analysis of various literature sources and applying them in structuring and formulating scientific reasoning in cryptology.
  • Is capable of carrying out an independent limited research or development project in cryptology under supervision, following the applicable ethical rules.

General competence:

  • Is capable of analyzing relevant professional and research ethical problems in cryptology.
  • Is capable of applying his/her cryptographic knowledge and skills in new fields, in order to accomplish advanced tasks and projects.
  • Can work independently and is familiar with cryptographic terminology.
  • Is capable of discussing professional problems in the field of cryptology, both with specialists and with general audience.
  • Is capable of contributing to innovation and innovation processes.

Topic(s)

  • Introduction – classical cryptography (Shift/Caesar cipher, Vigenere, Beaufort, Enigma, Vernam), basic information theory and unicity distance, security of classical ciphers
  • Symmetric ciphers 1 (stream ciphers) – randomness and pseudorandomness, one-time pad versus a keystream generator, period and linear complexity, pseudorandom sequence generators (congruence generators, linear and non-linear feedback shift registers, non-linear filters, non-linear combiners, non-uniform decimation of sequences, examples of stream cipher designs (Snow 3G, ZUC)), statistical testing of pseudorandom sequences, cryptanalysis of stream ciphers (the Berlekamp-Massey algorithm, algebraic attacks/immunity, correlation attacks/immunity)
  • Symmetric ciphers 2 (block ciphers) – definition, permutations of sets of 2^N elements, confusion/diffusion, Feistel ciphers and Substitution-permutation networks, S-boxes and non-linearity (differentially k-uniform mappings), examples of Feistel and SPN designs (DES and T-DES, KASUMI, AES), cryptanalysis of block ciphers (algebraic attacks, known plaintext attacks (differential and linear cryptanalysis))
  • Asymmetric ciphers – definition, intractability and NP-completeness, the Diffie-Helman cryptosystem, the RSA system, primality testing (Legendre and Jacobi symbols, Solovay-Strassen, Miller-Rabin), factorization (Pollard rho), discrete logarithm (the baby step/giant step algorithm, the ElGamal cryptosystem), elliptic curves
  • Hash functions and digital signatures – definition of hash functions, basic security properties (one-wayness, second pre-image, collision), basic construction (Davies-Meyer, Merkle-Damgård, sponge construction), applications (integrity check, HMAC), examples of hash function designs (MD5, SHA-2, SHA-3/KECCAK), digital signature definition, digital signature with RSA, signing and hashing.

Teaching Methods

Lectures
Exercises

Teaching Methods (additional text)

Lectures

Numerical exercises

The course will be made accessible to both campus and remote students. Every student is free to choose the pedagogic arrangement form that is best fitted for her/his own requirement. The lectures in the course will be given on campus and are open for both categories of students. All the lectures will also be available on Internet through the learning management system.

Form(s) of Assessment

Written exam, 5 hours

Grading Scale

Alphabetical Scale, A(best) – F (fail)

External/internal examiner

Evaluated by internal examiner. An external examiner will be used every 5th year, next time in 2019.

Re-sit examination

Ordinary re-sit examination in August.

Examination support

Calculator, dictionary

Coursework Requirements

None

Teaching Materials

Books:  

1. Introduction to Cryptography and Coding Theory, 2. edition, Trappe W., Washington L., Prentice Hall, 2006, ISBN: 0131981994.

2. Handbook of Applied Cryptography, Menezes A., http://www.cacr.math.uwaterloo.ca/hac

Replacement course for

IMT4532 Cryptology 1, IMT4552 Cryptology 2

Additional information

The students that have already taken the course "Introduction to cryptology" at the bachelor level and that continue with the master's program in information security cannot be exempted from taking the course "Cryptology" on the master's level.

The course will be taught for the first time in spring 2017.