Letter frequency analysis is a common technique for solving substitution and Vigenère ciphers. In this note, we apply similar techniques to the autokey cipher. This isn’t much harder but appears to be less well-known.
This post discusses the problem of computer-assisted decryption of un-parsed substitution ciphers. Sample Mathematica code is linked within.