Discrete Logarithm Problem (DLP)
The Discrete Logarithm Problem involves finding the integer \(a\) such that \(g^a \equiv b \mod p\), given \(g\), \(b\), and \(p\). Currently, there is no known efficient solution for this problem over carefully chosen groups.
Resources
Last updated on