0

I mean, $n$ can also be easily used to find the factors $p$ and $q$ right?

Raoul722
  • 3,003
  • 3
  • 23
  • 42
Kp23
  • 17
  • 1

1 Answers1

5

No, it is not easy! RSA is based on the difficulty of factoring the product $n=pq$ of two large prime numbers. But if you know $\varphi(n)$ for plain RSA you can compute the secret exponent $d=e^{-1}\bmod \varphi(n);\;$ and you can factor $n$ from the two equations $n=pq,\;\varphi(n)=(p-1)(q-1)$.

gammatester
  • 1,005
  • 1
  • 8
  • 12