This passage is a bit confusing because it's not correct that every natural number has a primitive root (e.g. consider n = 8): For example, using only typing it is possible to define ... the type (n : ...
We will solve this problem by reducing it to the discrete logarithm problem. Let's apply the concept of a primitive root modulo $n$. Let $g$ be a primitive root ...
An illustration of a magnifying glass. An illustration of a magnifying glass.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback