When the encryption exponent and the plain text are both much smaller than the modulus,

RSA will be under the threat of attacks. In this task, you are given a unique RSA public key

with an extremely small public exponent $(e=3)$ and the cipher text. At the same time, the

plain text is also relatively small $(342$ bits$)$ compared with $n(1024$ bits$).$ Your goal is to recover

the plain texts with the provided information.

Finish the function recover$\_$message in file small$\_$exponent$\_$short$\_$message$\_$attack.py$.$

def recover$\_$message $($N$,$ E$,$ C$)$:

m $=0$return m