Cipher identifier

How it works

A cipher identifier does not decrypt every unknown string. It measures visible properties and ranks classical methods that could have produced them. Paste the complete sample, select Identify, and read each confidence score together with its reason. A high score means the format strongly matches a known signature; it is evidence, not a mathematical guarantee.

The first checks examine the character set. Dots, dashes, spaces, and slashes strongly indicate Morse code. An eight-bit stream made only from zero and one suggests binary text. Even pairs of digits from 11 through 55 fit a Polybius square. A ciphertext using exactly A, D, F, G, V, and X fits the coordinate alphabet of ADFGVX. Base64 has its own letters, digits, slash, plus sign, four-character length, and optional equals-sign padding.

Other signals are statistical. The index of coincidence measures the chance that two letters selected from a sample match. Ordinary language passed through a fixed substitution or transposition often stays near the English value around 0.066. A repeating-key polyalphabetic cipher tends to flatten the distribution toward roughly 0.038. Short samples vary widely, so the tool lowers confidence rather than forcing one exact interpretation.

For Caesar candidates, the detector tries all twenty-five backward shifts. It compares each result with English letter frequencies and looks for common words. When one shift scores clearly better, the candidate includes the decoded plaintext directly. You can still open the Caesar page with the original input pre-filled and inspect every possible shift.

The results may overlap. A short Collon ciphertext can also resemble an ordinary substitution because both use letters, and a Playfair-compatible string can satisfy broader monoalphabetic statistics. Ranked alternatives are more honest than a single unsupported label. More ciphertext usually produces better frequency evidence, while spaces and known context can help a human decide between candidates.

Detection signals

The ranking engine applies these checks independently, then sorts compatible candidates by confidence.

Worked example

Suppose the unknown text is KHOORWKLVLVDVHFUHWPHVVDJH. It contains only letters, so Morse, binary, numeric Polybius, Base64 padding, and the six-letter ADFGVX alphabet do not fit. Its repeated letters and frequency profile remain compatible with a fixed substitution.

1. Normalize the sample: remove nonletters and convert it to KHOORWKLVLVDVHFUHWPHVVDJH.
2. Try every Caesar shift: shift 1 begins JGNNQ, shift 2 begins IFMMP, and shift 3 begins HELLO.
3. Score the output: shift 3 produces common English fragments including HELLO, THIS, SECRET, and MESSAGE. Its letter frequencies also fit English better than the neighboring shifts.
4. Rank the match: return Caesar cipher with shift 3 as a high-confidence candidate and display HELLOTHISISASECRETMESSAGE.
5. Open the tool: the result link carries the original ciphertext in a URL fragment. The text stays in the browser and appears in the Caesar input field for manual verification.

This worked example succeeds because the sample is long enough and contains recognizable words. A five-letter sample such as KHOOR may still suggest shift 3, but many other shifts can resemble fragments of words by chance. The confidence should reflect that uncertainty.

What the identifier cannot do

The identifier cannot determine a cipher from every string. Classical systems can share the same alphabet and similar statistics. A keyed substitution, transposition, Playfair message, and short Vigenere sample may all look like uppercase letters with no decisive marker. A result should be treated as a shortlist for testing, not as proof of authorship or method.

Modern encryption such as AES or RSA is designed to produce output indistinguishable from random data. This tool will never reliably identify the algorithm, key, mode, or plaintext from modern ciphertext alone. Compressed data, hashes, random tokens, and encrypted bytes can also resemble one another. Returning a confident classical-cipher guess in that situation would be misleading.

Encoding is not always encryption. Binary and Base64 are reversible representations with recognizable formatting, while Morse is a public signaling alphabet. Their appearance in the candidate list means the text may be directly decodable without a secret key. It does not mean the original author attempted cryptographic protection.

Sample quality matters. Paste the complete ciphertext when possible, retain meaningful separators, and check whether the source mentions a grid, keyword, period, historical setting, or language. Text from another language has different frequencies from English and can reduce the quality of the Caesar and coincidence scores.

Related cipher tools

• The Caesar page verifies the detected shift and displays all twenty-five decoding candidates.
• The Vigenere page estimates repeating-key length and decodes when you know the keyword.
• The Morse translator decodes the strongest dot-and-dash signature and can play it as 600 hertz audio.
• The Polybius page decodes row-column pairs from 11 through 55 and exposes the selected grid.
• The ADFGVX page handles the distinctive six-letter coordinate alphabet and keyed transposition.
• The Collon page checks the doubled length, small indicator alphabet, series length, and grid-edge variant.

Frequently asked questions

Privacy note

All detection runs in your browser. Your sample never leaves your device and is never transmitted to ToolPlex.