Bob uses RSA with a public key (n, e), and he announces that he can decrypt any message c = E(m) = m^e (mod n) sent to him insecurely, and then return m = D (c) = c^d (mod n) securely to the sender. Show that this is a bad strategy. Bob uses RSA with a public key (n, e), and he announces that he can decrypt any message c = E(m) = m^e (mod n) sent to him insecurely, and then return m = D (c) = c^d (mod n) securely to the sender. Show that this is a bad strategy