One of the big questions that remained unanswered during my childhood was how enciphered messages can be deciphered. I knew that some bit of statistics was involved to somehow match up the frequencies of words but had not the formal language to actually concretize this idea. Now I've been able to reduce the problem decryption, assuming the encryption cipher is a bijection between two sets of symbols of equal cardinality, to: $$\arg\min_\mathbf{F} \bigg[\ln \mathcal{L} \propto \mathbf{X}_R\cdot \mathbf{F}\cdot\ln\mathbf{p}_R\bigg]$$ subject to $\mathbf{F}$ living in the symmetric group of $\mathbf{I}$