RSA $(2$ pt$.).)$

Let $p=23$ and $q=5,N=115.$ Create an RSA triple $(N,e,d).$ Choose

a message $m0,1$ and encrypt it with plain RSA accordingly. Then,

decrypt the resulting cyphertext $c,$ and check that $c^d=$mmodN.

Let p $=23$ and q $=5,$ N $=115.$ Create an RSA triple $($N; e; d$).$ Choose

a message m $6=0$; $1$ and encrypt it with plain RSA accordingly. Then,

decrypt the resulting cyphertext c$,$ and check that cd $=$ m mod N$.$