Suppose Bob has an RSA Cryptosystem with a large modulus n for which the factorization cannot be found in a reasonable amount of time. Suppose Alice sends a message to Bob by representing each alphabetic character as an integer between 0 and 25 (i. e., A ↔ 0, B ↔ 1, etc.), and then encrpyting each residue modulo 26 as a separate plaintext character.