Reputation
Top tag
Next privilege 125 Rep.
Vote down
Badges
6
Impact
~895 people reached

  • 0 posts edited
  • 0 helpful flags
  • 11 votes cast
Oct
27
comment Why do we need in RSA the modulus to be product of 2 primes?
Oh.... so because the attacker would know $\phi(N)$, he would be able to deduce $d$ from $e$ because $de=1$ in mod $\phi(N)$. I think I am starting to get it.