On a cyclic structure of generators modulo primes

In this paper, we introduce a new notion called the $\mathit{\text{set}}\mathit{\text{of}}\mathit{\text{missing}}\mathit{\text{generators}}$ $\mathcal{M}(g)$ for a generator (or primitive element) $g$ of the cyclic group ${\mathbb{Z}}_p^{\ast }$, where $p$ is an odd prime. The cardinality of $\mathcal{M}(g)$ is established for all odd primes $p$. For primes $p$ of the form $2^i{q}_1^{j_1}{q}_2^{j_2}+1$, the collection $V_p=\{\mathcal{M}(g):g\in \mathcal{G}\}$ forms an equinumerous partition of $\mathcal{G}$ (the set of all generators of ${\mathbb{Z}}_p^{\ast }$), and a digraph defined on the vertex set $V_p$ is a disjoint collection of unicycles of the same size. Thus, for every such prime, an unique triplet $(c,n,e)$ of integers, describing the structure of the digraph of missing generators, can be associated. With the help of cyclic structure, we present a macroscopic additive property of generators of ${\mathbb{Z}}_p^{\ast }$. Further, we show that factoring RSA numbers is computationally equivalent to computing $T(p)$, under the assumption that there exists an absolute constant $k$ such that the set $\{2^i{N}^j+1:1\le i,j<{\log }^{k}N\}$ contains a prime for any given odd $N$.