Score:1

RSA: decipher c when everything except N is known

gb flag

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$.

DannyNiu avatar
vu flag
Are $p$ and $q$ known? I'm implicitly assuming yes.
Beru avatar
gb flag
@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.
DannyNiu avatar
vu flag
There seems to be a [duplicate](https://crypto.stackexchange.com/q/105702/36960) *homework* questions. The fellows gave some hint on it.
I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.