I've came across an example where the e value is three but no matter what tool/script I try, I can't decrypt it. I'm wondering if the ciphertext and n is super super large, is it possible to crack it even if e=3?

  • $\begingroup$ If one uses Textbook RSA and $e=3$ then the cube-root attack is the simple attack. Otherwise, this question is not clear about padding applied or not. $\endgroup$
    – kelalaka
    Jan 14, 2022 at 14:55
  • 2
    $\begingroup$ The cube root attack (for $e=3$) will always fail if the plaintext (after padding, if padding is applied) is larger than $\sqrt[3]{n}$. $\endgroup$
    – poncho
    Jan 14, 2022 at 16:21


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.