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 ...

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 : ...

This is a preview. Log in through your library . Abstract In this paper the densities D(i) of prime numbers p having the least primitive root g(p) = i, where i is equal to one of the initial positive ...

Abstract: Recently, number theory has proved its importance in cryptography because of its well-known hard problems. For instance, a primitive root for a prime number shows a special property of ...