Inverse of an element in a RSA group
Mathematically does there exists efficient algorithm $\mathcal{A}$


Yes; the Extended Euclidean algorithm can be used to efficiently compute multiplicative inverses modulo $N$, without knowledge of the factorization of $N$.