Suppose the decryption key $d$ of a RSA cryptosystem is hacked and instead of choosing a new $n$ if encryption and decryption keys are changed with same $n$,then is this safe ?
My attempt: Previous encryption key $e$ and decryption key $d$ are known. Then $ed \equiv 1$(mod $\varphi(n)$)
i.e, $\;ed-1 = k \cdot \varphi(n)$, for some natural number $k$.
$\implies \varphi(n) =\frac{ed-1}{k}$
So we get $\varphi(n)$ and could get prime factors of n.
Is this right?
The vulnerability as mentioned by @Randall, here is additional detail.
From the paper, "Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?" by Alexander May and Maike Ritzenhofen:
...
The original Simmons paper is here.