Mathematics of cryptography
In this course we look at a number of asymmetric 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.
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.
-
Course structure
The course consists of two elements, theory and computer exercises.
Teaching format
Instruction is given in the form of lectures, exercises sessions and computer exercises.
Assessment
The course is assessed through written examination and written presentation of the computer exercises.
Examiner
A list of examiners can be found on
-
Schedule
The schedule will be available no later than one month before the start of the course. We do not recommend print-outs as changes can occur. At the start of the course, your department will advise where you can find your schedule during the course. -
Course literature
Note that the course literature can be changed up to two months before the start of the course.
Hoffstein, Pipher & Silverman: An Introduction to Mathematical Cryptography. Springer.
-
Course reports
-
More information
New student
During your studiesCourse web
We do not use Athena, you can find our course webpages on kurser.math.su.se.
-
Contact
