I need to calculate the number of possible public keys.
The tuple for the public key is defined as: $Key_{Publ} = (n,a)$
So: Let $p:=83$ and $q:=163$
$n= p \cdot q = 83 \cdot 163 = 13529$
$\phi(n) = (p -1 )(q - 1) =(83 - 1)(163 - 1) = 13284$
Question: How is it possible to calculate the number of possible $a$'s in $\gcd(a , \phi(n))$ with $a \in [1, \phi(n)]$ ? So I will be able to calculate the possibilities with $n \cdot a$?
I have two possible ways to calculate $\phi(n):$ $$\phi(n)=(p-1)(q-1)$$ $$\phi(n)=\prod_{p \in \mathbb P}(p^{v_p(n)-1}(p-1))$$
I appreciate every hint.