Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring
A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.