0
$\begingroup$

Is there any way to decrypt RSA ciphertext $c = m^e \bmod n$ when $\gcd(p-1,e) > 1$?

$\endgroup$
0

Browse other questions tagged or ask your own question.