Algorithm Details for: Kasiski Test

1. Determine repeating strings of characters in the ciphertext (of length at least four).
2. Tabulate the distances between occurences.
3. The probable key length is a divisor of the greatest common divisor (GCD) of all the distances.

Alogorithm taken from Lewand pg 84 - 86 (see sources page).