Given e,d,N such that $e \cdot d \equiv 1 \mod \phi(n)$. Can we efficiently calculate $\phi(N)$.

$\phi(N)$ will have multiples values. We need to eliminate those values that are

1. higher than N
2. Odd and some other criteria

Is there any efficient algorithm to find $\phi(N)$.

Given $e,d,N$ such that $e \times d \equiv 1 \pmod{ \varphi(n)}$. Can we efficiently calculate $\varphi(N)$.

$\varphi(N)$ will have multiples values. We need to eliminate those values that are

1. higher than $N$
2. Odd and some other criteria

Is there any efficient algorithm to find $\varphi(N)$.

Given e,d,N such that [ed mod ϕ(n)] = 1. Can we efficiently calculate ϕ(n).

ϕ(n) will have multiples values. We need to eliminate those values that are

1. higher than N
2. Odd and some other criteria

Is there any efficient algorithm to find ϕ(n).

Given e,d,N such that $e \cdot d \equiv 1 \mod \phi(n)$. Can we efficiently calculate $\phi(N)$.

$\phi(N)$ will have multiples values. We need to eliminate those values that are

1. higher than N
2. Odd and some other criteria

Is there any efficient algorithm to find $\phi(N)$.