# Questions tagged [index-of-coincidence]

The index of coincidence (IC) is a measure of the relative frequency of letters in a cipher text sample, which facilitates cryptanalysis of poly-alphabetic ciphers by allowing determination of the period t, length of the key, as an alternative to Kasiski’s method.

11 questions
1answer
75 views

### Mutual Index of Coincidence

I can't seem to find a simple explanation of Mutual Index of Coincidence. I am finding explanations of Mutual Index of Coincidence not Index of Coincidence. I don't understand what the formula below ...
1answer
85 views

### Checking if a sentence is English after decryption

I wrote a program that will loop through the anagrams of a word and run each one through the decryption of a columnar transposition cipher on a document. However, for a certain word, the number of ...
0answers
101 views

### Avoiding doubled letters in encrypted text

I have an encrypted string based on an "alphabet" of 29 runes and access to successfully decrypted (runes->English) plaintext. Testing for a Vigenere cipher, I tried a Friedman attack (aka Kappa test, ...
1answer
207 views

### K Friedman - two texts explanation

I read the $K$-Friedman test to determine the period of a Vigenère ciphertext, and I understand something like this: $K$-Friedman test tries to find out what period of the cipher by calculating some ...
1answer
369 views

### Words in “index of coincidence” in relation to the Vigenère cipher

I am trying to interpret the formula for index of coincidence from here… I am not understanding $f_i$. How can I calculate $f_i$ in this context? Is this the appearance of single word like (...
1answer
1k views

### For calculating the index of coincidence for each sequence

I was learning about the finding the key length reading the following web site... http://practicalcryptography.com/cryptanalysis/stochastic-searching/cryptanalysis-vigenere-cipher/ and I really don't ...
0answers
159 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 = \Bigl(\varphi(l)-\varphi(o)\Bigr)/\Bigl(\...
1answer
675 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 ...
1answer
1k views

### Hamming Distance vs. Index of Coincidence

When analyzing a repeating-key xor cipher to find the key length, I've read about two key methods (assuming there aren't just repeating chunks of ciphertext for Kasiski's method), for some assumed key ...
1answer
1k views

### Expectation Value of the Index of Coincidence

Can Anybody tell me why the expectation value of the Index of Coincidence is the following? For a cipher text string of length $L$, where $n$ is the number of alphabet characters, $k_r = 1/n$, and \$...
1answer
13k views

### How does the index of coincidence work in the Kasiki test?

I'm starting to learn about cryptanalysis and I am having a bit of difficulty understanding the Kasiski test's index of coincidence. I have a book (Cryptography Theory And Practice by Douglas Stinson) ...