For questions related to the discrete logarithm problem; modulo $p$, in finite fields, over elliptic curves, or in an abstract group.
For a cyclic group $G$ with generator $g$, a discrete logarithm of $b \in G$ to the base $g$ is an integer $k$ such that $g^k = b$.
Finding a discrete logarithm is (believed to be) a computationally hard problem, and various cryptographic protocols are built around it.
The underlying cyclic group is often the multiplicative group of $\mathbb{Z}/p\mathbb{Z}$ for some prime $p$, more generally a multiplicative subgroup of a finite field, or a cyclic group of points on an elliptic curve.
The intended usage of this tag is for questions on or related to the discrete logarithm problem (theoretic as well as algorithmic) and its applications.
Related tags include:
