New answers tagged security-definition
1
vote
Accepted
If RSA uses $e$ with $\gcd(e,\phi(N))\ne1$ but $e$ is hard to factorize has an adversary still an advantage in finding $d$ for $m^{ed}\equiv m\mod N$?
One obvious factorization method be to do:
...
- 132k
Top 50 recent answers are included