Caesar Cipher and Modular Arithmetic

Modular Arithmetic in the Caesar Cipher

The Caesar cipher is one of the simplest practical applications of modular arithmetic. Understanding the math behind it provides a foundation for more advanced cryptographic concepts.

The Basic Formula

Encryption:

E(x) = (x + k) mod 26

Decryption:

D(x) = (x - k + 26) mod 26

Where:

• x = the letter's position (A=0, B=1, ..., Z=25)
• k = the shift (key)
• mod 26 = the modulo operation ensuring the result stays within 0–25

Why Modular Arithmetic?

The alphabet is circular. After Z comes A again. Modular arithmetic naturally handles this wrapping:

X (23) + 3 = 26 → 26 mod 26 = 0 → A
Y (24) + 3 = 27 → 27 mod 26 = 1 → B
Z (25) + 3 = 28 → 28 mod 26 = 2 → C

Without the mod operation, we would get positions beyond 25, which do not correspond to any letter.

Group Theory Perspective

The set of integers {0, 1, 2, ..., 25} under addition modulo 26 forms a cyclic group denoted Z₂₆. Each Caesar cipher shift is a group element, and encryption is the group operation.

Key properties:

• Closure: Any shift of any letter produces another valid letter
• Associativity: (a + b) + c ≡ a + (b + c) (mod 26)
• Identity: Shift 0 is the identity (no change)
• Inverse: Every shift k has an inverse 26 - k

The Special Case of k = 13

When k = 13:

Inverse of 13 = 26 - 13 = 13

The encryption key equals the decryption key. This is ROT13's self-reciprocal property expressed algebraically.

Implementation in Code

function caesarEncrypt(text, shift) {
  return text.replace(/[a-zA-Z]/g, char => {
    const base = char <= 'Z' ? 65 : 97;
    return String.fromCharCode(
      ((char.charCodeAt(0) - base + shift) % 26) + base
    );
  });
}

The % 26 operation is the direct implementation of mod 26 in JavaScript.