Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It only takes a minute to sign up.
Sign up to join this community
There is a 128-bit AES key $m$, and it's encrypted by 1024-bit RSA modulus $n$ as $$c = (m\mathbin\| m\mathbin\|\ldots\mathbin\|m)^e \bmod n.$$
There are eight $m$ in $m\mathbin\| m\mathbin\|\ldots\mathbin\|m$.
Is there any way to find a message $m$?
The key is repeated 8 times, but I can't utilize this information to decrypt.
There is no proper padding and the message $m$ can be recovered easily if $e$ is small.
First, we can rewrite $(m\mathbin\| m\mathbin\|\ldots\mathbin\|m)$ as $$ (m + m2^{128} + \cdots + m2^{128\times 7}) = m(1 + 2^{128} + \cdots + 2^{128\times 7}), $$ and when we put it back in the equation, we have $$ c = m^e(1 + 2^{128} + \cdots + 2^{128\times 7})^e \mod n. $$ We can compute $$ c' = c\times (1 + 2^{128} + \cdots + 2^{128\times 7})^{-e} \mod n, $$ so we have the relation $c' \equiv m^e \bmod n$. In the case that $m^e < n$ (which happens for $e=3$, $5$ or $7$), then this is in fact an equality: $$ c' = m^e. $$ The value $m$ can be recovered by taking the $e$-nth root of $c'$.
