Stockholm university logo, link to start page
Gå till denna sida på svenska webben

Mathematics of cryptography

Since the 1970s we often consider cryptography systems based on mathematical problems that are difficult to solve. In this course we look at a number of assymetric cryptosystems, the mathematical problems underlying them, and different algorithms to solve these problems.

The course covers basic concepts in encryption and the mathematical problems, with associated mathematical theory, which is the basis for applications in asymmetric cryptology such as RSA (both as crypto and as digital signature), DH, El Gamal, ECDH, ECDSA, and Miller-Rabin.

Different algorithms (to solve these mathematical problems) are studied with a focus on complexity.

Algorithms covered include binary exposure, Shank's baby-step giant-step, Pohlig-Hellman, Pollard's p-1, QS, index calculation, Pollard's rho and Lenstra's ECM.