A STATISTICAL ATTACK ON THE RUNNING KEY CIPHER
Craig P. Bauer, Christian N. S. Tate · Cryptologia · 2002
The frequencies of n-graphs, groups of n letters, for n as large as 6 are compiled and used to launch a statistical attack on a running key cipher. Programs written in C++ make the calculations possible. The results of the attack for various values of n are analyzed.