1
ϕ
(
n
)
itself is easily computed for an RSA modulus
n
=
pq
since
ϕ
(
n
) = (
p
-
1)(
q
-
1)
.