Consider the Rabin variant of the RSA system. So, only the number n is public. Suppose that a message
has been sent that has a non-trivial factor in common with n. How many possible plaintexts will the receiver find at the end of the decryption process?