1
$\begingroup$

Is it possible to solve this:

If you have the following information about an RSA ecrypted plaintext $m$:

$e = 65537$
$d$, $c$ some very large numbers
$p$ and $q$ are both random 128-bit long prime numbers
$m$ is a string build with 16 random characters of both ascii letters and digits

If $N$ would be known $m \equiv c^d \mod N$ could be computed, however I have no clue how I would get either $m$ or $N$.

$\endgroup$
3
  • $\begingroup$ Are $p$ and $q$ known? I'm implicitly assuming yes. $\endgroup$
    – DannyNiu
    Mar 17, 2023 at 1:08
  • $\begingroup$ @DannyNiu No, I don't know what their value is. The only information about them is that they are 128-bit long prime numbers. But $c$ and $d$ are know. I can provide you with numbers if that may be of help. $\endgroup$
    – Beru
    Mar 17, 2023 at 2:12
  • $\begingroup$ There seems to be a duplicate homework questions. The fellows gave some hint on it. $\endgroup$
    – DannyNiu
    Mar 17, 2023 at 2:21

0

Browse other questions tagged or ask your own question.