> [!NOTE] **Definition** (Discrete Logarithm) > If we have a [[Cyclic Group|cyclic group]] $G$ with generator $g$, we call $n$ the *discrete logarithm* of $g^{n}$. # Properties ... # Applications **Algorithms**: The [[Discrete Logarithm Problem (DLP)|DLP]] is the problem of finding the discrete logarithm of an element of a cyclic group to the base of a generator. It is considered to be computationally intractable. There is an efficient [[Shor's algorithm|quantum algorithm]] due to Peter Shor.