# Understanding how Oscar can decrypt a message in RSA

I have the following set-up:

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

I want to figure out how Oscar can easily decrypt a message in this case. However, I don't really understand how the encryption works here.

For RSA we have

$e_k(x)=x^b\bmod{n}$

But I don't understand what $b$ would be in this case and I don't fully understand what 'then encrypting each residue modulo 26 as a separate plaintext character' implies. Would this mean that each character is encrypted as

$e_k(x)=x^b\bmod{26}$?

Let's assume textbook RSA, which is not apparent from the question. In that case $b$ is the public exponent (usually this is $e$). So yes, encryption is then the first-to-last formula if $x$ is the index in the alphabet of the character. However, the $\bmod 26$ in the last formula doesn't need to be used; I think that the text is just used to indicate that $x$ is within the range $[0, 26)$. The word residue is out of place here; no division is performed on the alphabet, so there is no residue. The modulus for RSA encryption is just $n$.