Polybius Square Cipher Tool

The Polybius Square is an ancient encryption method invented by the Greek historian Polybius around 200 BC. It uses a 5×5 grid containing 25 letters (I and J are combined into one cell). Each letter is represented by its row and column coordinates — typically two numbers from 1 to 5 (or letters from A to E). For example, in the standard alphabet grid, A → 11, B → 12, HELLO → 23 15 31 31 34.

The English alphabet has 26 letters, but the Polybius Square is a 5×5 grid with only 25 cells. To fit all letters, I and J share one cell. During encoding, any J is automatically treated as I. When decoding, that cell returns I by convention. This was a practical compromise used for centuries in classical cryptography.

A keyword (like "CRYPTO") rearranges the letters inside the 5×5 grid. The key is written first (with duplicate letters removed), then the remaining alphabet letters fill the rest of the grid in order. This changes the coordinate mapping entirely — the same plaintext will produce different ciphertext depending on the key. Without the correct key and grid layout, the message cannot be decoded.

No. The Polybius Square is a substitution cipher and is not secure by modern standards. It is vulnerable to frequency analysis and can be broken easily with computational tools. It is best used for educational purposes, puzzles, escape rooms, and historical demonstrations. For real security, use modern algorithms like AES-256.

This tool supports two coordinate systems: Numeric (1–5) where rows and columns are numbered 1 through 5 (e.g., A = 11, B = 12), and Alphabetic (A–E) where rows and columns use letters A through E (e.g., A = AA, B = AB). You can also choose output separators: space, comma, dash, or none (compact output).

If the key is unknown, you can try frequency analysis on the coordinate pairs. Since the Polybius Square is essentially a monoalphabetic substitution (each coordinate pair always maps to the same letter), patterns in the ciphertext can reveal common letters like E, T, A, O. You may also brute-force by trying common keywords or use the standard grid (no key) as a starting point.