Vigenere Cipher Solver

This solver uses a simulated annealing / hill climbing approach to find the most likely Vigenere key. It generates random keys, mutates them, and scores the resulting plaintext against English quadgram frequencies. The algorithm explores the key space using temperature-based probabilistic acceptance, allowing it to escape local optima and converge on the correct key. Vigenere and autokey can be cracked with a ciphertext-only attack, and are aided with a known key-length.