https://RustRocket.rs -- Cloud Monk Losang Jinpa, Ph.D., MCSE / MCT, https://Rustaceans.rs, Full Stack Cloud Native Rust DevOps Engineer - Rocket Framework Rust Microservices on Kubernetes-AWS-Azure-GCP

In mathematics, for given real numbers ${\displaystyle a}$ and ${\displaystyle b}$, the logarithm ${\displaystyle log_{b}(a)}$ is a number ${\displaystyle x}$ such that ${\displaystyle b^{x}=a}$. Analogously, in any group ${\displaystyle G}$, powers ${\displaystyle b^{k}}$ can be defined for all integers ${\displaystyle k}$, and the discrete logarithm ${\displaystyle \log _{b}(a)}$ is an integer ${\displaystyle k}$ such that ${\displaystyle b^{k}=a}$. In arithmetic modulo an integer ${\displaystyle m}$, the more commonly used term is index: One can write ${\displaystyle k=\mathbb {ind} _{b}a{\pmod {m}}}$ (read "the index of ${\displaystyle a}$ to the base ${\displaystyle b}$ modulo ${\displaystyle m}$") for ${\displaystyle b^{k}\equiv a{\pmod {m}}}$ if ${\displaystyle b}$ is a primitive root of ${\displaystyle m}$ and gcd ${\displaystyle \gcd(a,m)=1}$.

Discrete logarithms are quickly computable in a few special cases. However, no efficient method is known for computing them in general. In cryptography, the computational complexity of the discrete logarithm problem, along with its application, was first proposed in the Diffie–Hellman problem. Several important algorithms in public-key cryptography, such as ElGamal, base their security on the hardness assumption that the discrete logarithm problem (DLP) over carefully chosen groups has no efficient solution.