Discrete Log Problem

Tags

security

The problem that there is no efficient algorithm for computing the discrete logs \( \mod p \) in general.

That is to say if we have three numbers \( m \), \( n \), \( g \) and a sufficiently large prime number \( p \), we can't find \( m \) or \( n \) from \( {g}^{mn} \mod p \) in an efficient amount of time.