cryptography - Why does the security of RSA depend on the non-factorability of the modulus n? -

Just wondering why RSA's security depends on the non-causality of the modulus?

Cheers!

Good ... The non-causality of the modulus n is not the whole story ..

As vlad has already told, if you know the factors of n, you can easily calculate personal exponent ...

(p-1) (Q-1) .. or in general ... If you know the main factor of p number [i], then you can calculate the product of all (pi [ii] - 1). Which is the PHI function ajar ... to know the number of mutual qualitative elements, nn

If you can factor to n, then this calculation becomes trivial. Yes ... if n consists only 2 large prime, and this coefficient is hard, it is not really trivial ...

However ... if you calculate PHI (N) Come up with any other idea ... the number of elements, which is a qualitative reciprocity ... the factorization wou Ld is probably not your problem anymore ...

Currently there are no other public There is no known method, such as the method of eels ... prod (p [i] - 1)

either PHI (n) To find a way to classify, or calculate in a different way, possibly going to be RSA breaker