Concepts of encryption, digital signatures, hash functions, symmetric and asymmetric cryptographic primitives;
basic aspects of algebra (knowledge of groups, rings, fields, finite fields) and number theory
(modular arithmetic, primality tests)

Aim of the course

The course has two parts:

Basic symmetric cryptographic functionalities from a constructive point of view: authentication and encryption
- Description of the basic security properties for these functionalities
- Description of widely used existing solutions such as CTR, GCM, and OCB, as well as the AES block cipher that can be used within
- Description and use cases of the sponge construction
- Formal reasoning as to why these constructions are secure, and under which assumptions
- Explanation on how to understand and interpret security claims
(taught by Bart Mennink (Nijmegen))

Public key cryptanalysis:
- classical cryptanalysis: factoring and (finite field and elliptic curve) discrete logarithms, number field sieve
- special cryptanalysis: Coppersmith methods and other lattice based attacks
- cryptanalysis of lattice-based systems: enumeration, sieving, locality based hashing, etc.
(taught by Benne de Weger (Eindhoven))


Bart Mennink (RU), Benne de Weger (TU/e)