Decodes any mono-alphabetic substitution cypher.
Unimplemented Ideas:
- Starting with the longest word, using the letters you already know because of the most common word, imput it in a Word Guesser, like https://github.com/Imaginatorix/Word-Guesser.
Why was it not implemented?
You need a database for each language, which is not ideal and practical for a small project like this.
/* This repository is still in development. It is still unable to make things clear. */
Useful Sources:
- https://en.wikipedia.org/wiki/Letter_frequency
- http://norvig.com/mayzner.html
- http://pi.math.cornell.edu/~mec/2003-2004/cryptography/subs/frequencies.html
- http://www.practicalcryptography.com/cryptanalysis/letter-frequencies-various-languages/english-letter-frequencies/
- https://www.mdickens.me/typing/letter_frequency.html