Cipher Identifier

Identify unknown ciphertext, classical ciphers, and common text encodings online. Paste a suspicious string and get a ranked list of likely cipher or encoding types with confidence scores, evidence labels, links to the matching tools, and automatic cracking when a supported candidate is strong enough.

Input
0 chars · 0 bytes
Try:
Result
✓ Statistical detection based on Index of Coincidence and frequency analysis ✓ Supports 8 alphabets: English, Russian, German, Spanish, French, Italian, Portuguese, Turkish ✓ Client-side processing only
Examples
Morse code
Input .... . .-.. .-.. --- / .-- --- .-. .-.. -..

The tool detects Morse code charset (dots, dashes, slashes) and returns ~95 % confidence.

Base64
Input SGVsbG8gV29ybGQh

Base64 charset with length divisible by 4 → ~90 % confidence.

Caesar cipher
Input KHOOR ZRUOG WKLV LV D WHVW RI WKH FDHVDU FLSKHU

High IoC and strong chi-squared signal identifies Caesar cipher (shift 3) with ~65 % confidence; the tool auto-triggers Caesar brute force.

Vigenère cipher
Input SX UKW RRI ZOWR YJ RSQCC MR GEQ DLC GSPCX MP XGWIQ SX UKW RRI YQI MP AGCHMW MR G

Lower IoC in polyalphabetic zone → Vigenère / Beaufort / Autokey candidates. Auto-triggers Vigenère cracker when confidence is high enough.

How the Cipher Identifier works

The Cipher Identifier analyzes unknown text and returns a ranked list of cipher and encoding candidates. Each candidate includes a confidence score, evidence labels, and a direct link to the related tool, so you can move from identification to verification without retyping the text.

The detector combines two kinds of signals. Pattern-based checks look for strict formats such as Base64 padding, hexadecimal-only input, binary groups, URL percent escapes, Unicode escape sequences, Morse symbols, A1Z26 numbers, Polybius-style coordinates, and JWT dot-separated structure. Statistical checks then examine alphabetic ciphertext with the Index of Coincidence, chi-squared letter frequency, bigram readability, common n-gram matches, and cipher-specific heuristics.

When one supported candidate reaches at least 70% confidence and leads the next candidate by 10 percentage points or more, the service can automatically run the matching cracking workflow. This currently applies to supported brute-force or cracking actions such as Caesar, Affine, and Vigenere analysis, while the full candidate table remains visible for manual review.

Supported cipher and encoding families

The tool currently checks 27 detector types across several families: encodings and structured formats: Base64, Hexadecimal, Binary, URL encoding, Unicode escape, JWT; codes and alphabet systems: Morse code, Bacon cipher, A1Z26, Polybius Square; monoalphabetic ciphers: Caesar, ROT13, Atbash, Affine, Simple Substitution, XOR; polyalphabetic ciphers: Vigenere, Beaufort, Autokey, Gronsfeld, Alberti; fractionating ciphers: Bifid, Trifid; transposition ciphers: Rail Fence, Columnar Transposition; polygraphic ciphers: Playfair, Hill.

For language-dependent analysis, the alphabet setting can be left on auto-detect or limited manually to English, Russian, German, Spanish, French, Italian, Portuguese, or Turkish. Choosing the correct alphabet helps the frequency model compare the ciphertext against the right language profile.

What the result tells you

The result is not a single yes-or-no guess. It is a ranked diagnostic report for unknown ciphertext. The top row is the most likely candidate, the percentage shows relative confidence, and the evidence labels explain why the detector matched: format pattern, character set, IoC range, frequency shape, readable bigrams, common words, key-length signal, or cipher-specific scoring.

Use Open tool to continue in the matching cipher or encoding page with the same text carried over. If a candidate has a supported cracking action, use Crack to run the available solver directly from the identifier results. If an automatic result appears, it is a convenience result from the strongest supported candidate, not a replacement for checking close alternatives.

Best uses for cipher detection

This service is useful when you have an unknown encrypted message, puzzle text, CTF challenge, classroom cryptography exercise, encoded token, copied data fragment, or legacy cipher sample and need to know where to start. It helps separate simple encodings such as Base64, Hex, Binary, URL encoding, and JWT from classical cryptography such as Caesar, Vigenere, Playfair, Affine, Atbash, Rail Fence, Columnar Transposition, Polybius, Bacon, Bifid, Trifid, Hill, and related systems.

The identifier is especially helpful as a first step before decryption: it narrows the search space, suggests the most relevant tool, and shows whether the text looks more like a format, a substitution cipher, a polyalphabetic cipher, a transposition cipher, or a coordinate-based system.

Input quality and limitations

Short samples, mixed languages, heavy punctuation, transcription errors, and partially copied ciphertext reduce confidence. Strict encodings can often be recognized from short strings, but statistical identification for classical ciphers works best with longer alphabetic samples. As a practical rule, 50 or more letters gives the detector much more evidence than a single word or a short code.

The input limit is 3000 characters. For best results, paste the ciphertext itself, remove unrelated labels or explanations, preserve spaces only when they may be meaningful, and choose the likely alphabet if auto-detection is uncertain. The tool is designed for classical ciphers, educational cryptanalysis, and common text encodings; it is not a detector for modern cryptographic algorithms such as AES, RSA, or encrypted binary files.

FAQ

Accuracy depends heavily on text length, alphabet, noise, and cipher family. Structured formats and encodings such as Base64, Hex, Binary, URL encoding, Unicode escape, JWT, and Morse can be identified from short samples because they have strict character patterns. Classical cipher detection is statistical, so it becomes more reliable as the sample grows. A few words may only produce broad hints, while 50+ alphabetic characters usually give the detector much stronger evidence.

The Index of Coincidence (IoC) measures how unevenly letters are distributed in a text. Natural language has uneven letter frequencies, so its IoC is usually higher than random text. Caesar, Atbash, Affine, and many simple substitution ciphers preserve much of that frequency shape. Vigenere, Beaufort, Autokey, Gronsfeld, and similar polyalphabetic ciphers spread letters more evenly, producing a lower IoC. Comparing the measured IoC with language-specific reference values helps the tool separate cipher families before applying more specific tests.

Many classical ciphers share statistical fingerprints, especially when the text is short or the cipher introduces only subtle changes. Vigenere, Beaufort, Autokey, Gronsfeld, and Alberti can look similar; Caesar, Affine, Atbash, and simple substitution all preserve strong monoalphabetic patterns. Rather than hiding uncertainty, the tool returns a ranked list so you can compare the top candidates. If one candidate clearly dominates with at least 70% confidence and a 10-point lead, the identifier may run the supported cracking workflow automatically.

Yes. The identifier checks both cipher families and common encoded text formats. It can recognize patterns typical of Base64, Hexadecimal, Binary, URL encoding, Unicode escape sequences, JWT tokens, Morse code, A1Z26 numbers, and Polybius-style coordinates. This matters because many strings that look encrypted are actually encoded or formatted rather than encrypted with a classical cipher.

Sometimes. The identifier always returns candidates first. If the strongest candidate has a supported brute-force or cracking action and passes the confidence threshold, the service can show an automatic result. For other candidates, use the Open tool or Crack action to continue manually. Some ciphers require a secret key, matrix, alphabet, or additional assumptions, so identification does not always mean instant decryption.

The alphabet setting supports auto-detect plus English, Russian, German, Spanish, French, Italian, Portuguese, and Turkish. The selected alphabet affects frequency analysis, IoC comparison, chi-squared scoring, and readable-text checks. If you know the plaintext language, selecting it manually can improve the ranking.

No. The Cipher Identifier is built for classical ciphers, educational cryptanalysis, puzzle-style ciphertext, and common text encodings. Modern encryption such as AES, RSA, ChaCha20, or encrypted files is intentionally designed to look random and cannot be identified reliably from ciphertext alone without metadata, protocol context, keys, or file structure.

Paste the raw ciphertext or encoded string, not the surrounding explanation. Keep enough text for analysis, avoid mixing several different messages in one input, and remove obvious labels such as "ciphertext:" or "answer:". For classical ciphers, longer alphabetic text is much better than a single word. For encodings, preserve separators, slashes, dots, percent signs, padding, and line breaks when they are part of the format.
Related tools

Frequency Analysis

Analyze text frequencies and compare them with known language patterns for cryptanalysis.

Caesar Brute Force

Caesar cipher solver that tries every shift and highlights the most likely plaintext.

Letter Frequency

Online letter frequency analyzer with heatmap, letter counts, and language comparison.

Affine Cipher Solver

Affine cipher solver that tries all valid key pairs and ranks likely plaintext.

Vigenère Cracker

Automatic Vigenère cipher cracker with key recovery and ranked decryptions.