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:

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