*Discrete logarithms in cryptography*

Steven Galbraith (Royal Holloway College, University of London)

The discrete logarithm problem in finite fields is an important computational problem with applications in cryptography. These lectures will:

- define the discrete logarithm problem modulo a prime;
- explain some applications of this problem in public key cryptography;
- discuss some algorithms to solve the problem.