Most ciphers on this site work one letter at a time. The Hill cipher, invented in 1929 by Lester Hill, was the first cipher to bring real linear algebra into cryptography — it encrypts pairs of letters at once by multiplying them, as a vector, by a 2x2 key matrix.
What Is the Hill Cipher Tool?
Enter text and a 2x2 key matrix (four numbers), and the tool splits your message into letter pairs, treats each pair as a numeric vector, and multiplies it by your key matrix modulo 26 — instantly showing both the encrypted result and the matrix itself, along with its determinant.
How to Use It
- Open the tool at /tools/hill-cipher.
- Type your text (non-letter characters are stripped, and an odd-length message is auto-padded with “X”).
- Enter your 2x2 key matrix as four space-separated numbers, e.g.
3 3 2 5. - Click “Encrypt” or “Decrypt”.
Key Features
- Automatic key validation — warns if your key matrix’s determinant isn’t coprime with 26, which would make it impossible to decrypt.
- Automatic modular inverse matrix computation for decryption.
- Matches the classic textbook
HELP→HIATreference example exactly. - Live matrix and determinant display so you can see exactly what key is being used.
When to Use This Tool
- Learning how linear algebra can be used to build a cipher.
- Understanding why matrix invertibility matters for cryptographic reversibility.
- Solving or building a puzzle that uses matrix-based encryption.
Try It Now
Open Hill Cipher directly, or press ⌘K and type the tool name from anywhere on the site.
Part of the Security & Crypto collection on WebdevToolbox — free, browser-based developer tools with no login required.