This is an online course.

Please refer to the course homepage https://TBA for all relevant information. This page is only an excerpt and will not be updated.

This version of the course runs as a semester-long course based on the video lectures of 2MMC10, a course offered at TU/e. The homework submission dates are adjusted accordingly.

Please note, mathematics students at TU/e cannot take this course as a Mastermath course.

Prerequisites
Algebra (knowledge of groups, rings, fields, finite fields). These will not be presented as part of the course. Please check that your knowledge includes the following "Number Theory and Algebra" script https://hyperelliptic.org/tanja/teaching/cryptoI13/nt.pdf

Contents

  • The general structure of block ciphers, Feistel ciphers like DES, AES, the most suitable modes-of-use, e.g. CBC or OFB.
  • The principle of public key cryptography.
  • Diffie-Hellman key exchange, El Gamal, several methods to take discrete logarithms (baby-step giant-step method, the Pohlig-Hellman method, Pollard-rho and the index calculus method).
  • Elliptic curve cryptosystems.
  • The RSA system for encryption and signing, generating prime numbers by means of probabilistic primality tests, and several factorization algorithms (Pollard-(p-1), Pollard-rho, the random square method, the quadratic sieve method).
  • Hash functions, Message Authentication Codes
  • Formal security arguments, random oracle model
  • Some post-quantum systems (McEliece, NTRU, hash-based signatures, multivatiate systems of equations)

Remarks
Homepage for the course is still under maintenance.
For now you can have a look at the homepage from last year
 https://hyperelliptic.org/tanja/teaching/crypto17/
The homepage will link to the video lectures and homework sheets.

Lecturers
Andreas Hülsing