Tool to find a word encrypted with a simple substitution with a pattern. A word substituted by mono alphabetic cipher can be unsubstituted with a dictionary search (desubstitution).
Word Desubstitution/Pattern - dCode
Tag(s) : Substitution Cipher
dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!
Word Desubstitution/Pattern
De-substitution of a word
Answers to Questions (FAQ)
What is a mono-alphabetic substitution of a word? (Definition)
A mono-alphabetical word substitution is an encryption method where each letter of the original word is replaced by a single letter in the encrypted word.
Example: If MESSAGE is encrypted TUNNIZU, then the letter E is always replaced by the letter U
How to desubstitute a word ciphered by mono-alphabetical substitution?
To desubstitute an encrypted word by mono-alphabetic substitution, the user can use various techniques, including frequency analysis of letters, comparison with known words, or even the use of context if available.
The desubstitution of a single word, without a clue, must be based on the distribution of letters in the cipher word, specifically repeated and distinct letters in order to make a fingerprint/pattern.
Example: XYX is decomposed: one letter, then a second letter distinct from the first one, then the first letter again
With a fingerprint (idiomorph), it is possible to search in a dictionary for words with the same fingerprint and thus corresponding to a mono-alphabetic substitution.
Example: BOB, EVE or SMS can fit, but not CAB.
dCode can not find any result if the substitution is not monoalphabetic (ie it uses a unique alphabet, such a deranged alphabet) or if the word is not present in the dictionary.
What are the most favorable cases?
The fingerprint (or pattern) of the word must be specific, for example, include repetitions of letters. Indeed, if there are no repeated letters, then many words can match.
Why limiting to 2 words?
The number of combinations of words is exponential and beyond the computation times exceed the minute. There are faster heuristics but they do not guarantee a result, dCode prefers to guarantee a result rather than not displaying it. To decipher a sentence, the monoalphabetic substitution tool is much faster.
Source code
dCode retains ownership of the "Word Desubstitution/Pattern" source code. Except explicit open source licence (indicated Creative Commons / free), the "Word Desubstitution/Pattern" algorithm, the applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, breaker, translator), or the "Word Desubstitution/Pattern" functions (calculate, convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (Python, Java, PHP, C#, Javascript, Matlab, etc.) and all data download, script, or API access for "Word Desubstitution/Pattern" are not public, same for offline use on PC, mobile, tablet, iPhone or Android app!
Reminder : dCode is free to use.
Cite dCode
The copy-paste of the page "Word Desubstitution/Pattern" or any of its results, is allowed (even for commercial purposes) as long as you credit dCode!
Exporting results as a .csv or .txt file is free by clicking on the export icon
Cite as source (bibliography):
Word Desubstitution/Pattern on dCode.fr [online website], retrieved on 2024-11-18,
