1
vote
0answers
28 views

Index of coincidence for completely random text over k alphabets

I'm confused about /Friedman's method 2 (using a table with column of k size of key, and n/k rows, n is the total size for cipher text) \begin{equation} m = ...
3
votes
1answer
115 views

Friedman Index of Coincidence, pruning multiples of the keylength

I'm trying to write a Vigenere decipher script. I defined a couple of possible keylengths using the Kasiski method, using roughly this method: find recurring strings in the ciphertext between 3 and ...