Example 1
- Encode
- n = 1
- ABC
BCD
What does ABC become at shift 1? BCD.
The calculator shifts each A–Z letter by n places. ABC at 1 gives BCD. HELLO at 3 gives KHOOR. This is not Morse code.
Dots and dashes are on the Morse code translator. A character number is on ASCII and Unicode.
Enter a shift and text. The result will appear here.
The calculator shifts each A–Z letter by n places in the Latin alphabet. ABC at 1 gives BCD.
HELLO at 3 gives KHOOR. Decoding KHOOR at 3 returns HELLO.
After Z the alphabet wraps to A, so XYZ at 3 gives ABC. 29 is the same as 3, because 29 modulo 26 is 3.
A space stays a space. The calculator does not accept a digit or a Polish letter. This is not Morse.
Lowercase stays lowercase: abc at 1 is bcd.
A negative n moves backward. −1 from BCD gives ABC.
E(x) = (x + n) mod 26, D(x) = (x − n) mod 26
x is the letter position from 0 (A) to 25 (Z). n is an integer.
That is the classic Caesar shift. n = 3.
BCD
What does ABC become at shift 1? BCD.
KHOOR
What does HELLO become at shift 3? KHOOR.
HELLO
What comes back from KHOOR at shift 3 backward? HELLO.
BCD. A goes to B, B to C, C to D.
KHOOR. That is the classic +3. H→K, E→H, L→O, O→R.
HELLO. Decode subtracts the same n.
ABC. After Z the alphabet wraps to A.
No. 29 modulo 26 is 3. The result is the same.
No. A space stays a space. Only A–Z letters move.
No. This page uses the Latin A–Z alphabet. Polish letters and digits are not here.
No. Morse turns a letter into dots and dashes. Here the letter stays a letter, only shifted.
Yes. abc at 1 gives bcd. Case does not change.
Yes. −1 from BCD gives ABC. That is the same as decode at 1.
Under the result there is a list of 26 subtractions from the same text. You look for the sentence that makes sense.
The Caesar cipher is a shift modulo 26. The classic n is 3.
Page updated in 2026.