ABSTRACT

Let G be a finite group1 of size n. To start with, assume that G is cyclic, and g is a generator of G. Any element a ∈ G can be uniquely expressed as a = gx for some integer x in the range 0 6 x 6 n − 1. The integer x is called the discrete logarithm or index of a with respect to g, and is denoted by indg a. Computing x from G, g and a is called the discrete logarithm problem (DLP).