Lets say, instead of using a composite N = pq in the RSA cryptosystem, we just use a prime modulus p. As in RSA, we will have an encryption exponent e, and the encryption of a message m mod p would be m^e mod p. Is this modied RSA secure? Either argue why it is, or give a counter-example that breaks it (i.e., an adversary given only public parameters p,e,C = m^e mod p, can easily decrypt C to get plaintext m).