# In case M is small is it possible to recover the message

In the plain RSA encryption, suppose $N$ is 1024 bits and the public key $e = 17$. Is it secure to use this setting to encrypt very small message, say $3 \leq m \leq 9$? In other words, is it possible for the attacker to recover the message $m$ given the public key and the ciphertext $c = m^e \mod N$.

• That nice answer works even without using that the given $e=17$ is small. – fgrieu Mar 31 '16 at 11:55
No this it not even 'mathematically' secure, because for such small messages you have $m^e < N$ (and not only for $m\le 9$ but up to $m \approx 10^{18}$). And for these $c=m^e$ you can recover $m$ simply by computing the integer root $c^{1/17}$. This is easy because no modular roots are required, i.e. you can skip the hard part RSA.