Mathematics of cryptography

About this programme

The course covers basic concepts in encryption and the mathematical problems, with associated mathematical theory, which is the basis for applications in asymmetric cryptology. Mathematical problems included are integer factorisation, discrete logarithms in prime fields and elliptic curves, and the shortest vector problem in lattices. Different algorithms for solving these mathematical problems are studied with a focus on complexity. Algorithms covered are a subset of RSA, DH, El Gamal, ECDH, NTRU, binary exposure, Shank's baby-step giant-step, Pohlig-Hellman, quadratic sieves and Pollard's rho. Instruction is given in the form of lectures, exercises sessions and computer exercises. The course is assessed through written examination and written presentation of the computer exercises. Hoffstein, Pipher & Silverman: An Introduction to Mathematical Cryptography. Springer. To follow your passion. To be close to international career opportunities. To explore city and countryside. In Stockholm you can really get the best of both worlds. Here we explain all the different steps you need to go through when applying to a course or programme. Stockholm University arranges regular webinars and participates in educational fairs and events virtually and around the world to meet students and inform them about our study programmes. Every year Stockholm University welcomes thousands of international students from all over the world. Each bringing their own backpack full of experiences, expectations and dreams.