To speed up encryption it is tempting to use small encryption exponents, such as e=3. Suppose Bob is only sending a very small message 0 < m < N^(1/3) to Alice; this is quite likely, since public key cryptography is often used to securely transmit symmetric keys. Then c = m^3 and since c < N no modular reduction has taken place. Can Oscar compute the message m from the ciphertext c without breaking the RSA cipher? Suppose c=1728 and N=2623 (both are decimal numbers). The ciphertext m is

To speed up encryption it is tempting to use small encryption exponents, such as e =3. Suppose Bob is only sending a very small message 0