Let be a prime. We know that the group is cyclic. Let be a primitive root of , i.e. . For a number we want to know the unique number with
Furthermore, for a pair of distinct primitive roots, we also have, for any :
It is a difficult problem to compute the discrete logarithm, while powering is very easy. Therefore this is of some interest to cryptography.
|Date of creation||2013-03-22 14:54:27|
|Last modified on||2013-03-22 14:54:27|
|Last modified by||mathwizard (128)|