Three users have RSA public keys $,($they all use

e $=3),$ with N$1<$ N$2<$ N$3.$ Consider the following method for sending the

same message m in $\{0,1\}$l to each of these parties: choose a uniform r $$ Z$,$ N$1$

and send to everyone the same ciphertext