Score:1

RSA in pollynomial time

tv flag

If we know the RSA encryption of messages m, m+1, m+2 when c=3, how can we compute m in polynomial time?

poncho avatar
my flag
I assume by `c`, you mean the public exponent (which is more conventionally known as `e`)
Daniel S avatar
ru flag
HINT: Write the three cipher texts as polynomials in $m$. Look for a linear combination of these that is linear in $m$.
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.