For a basic “Count”, “Double-Letter Occurrence”, “Running IoC”, and “Concealment” analysis use this, general purpose, cipher analysis tool.
Quick IoC recap: Normal rune-english IoC is about 1.77. Values below 1.4 are highly unlikely to be anywhat meaningful. Predicting english text with IoC gets worse if the text is very short.
Here, we are considering either ᚠ being an interrupt; or it's inverse ᛠ. The numbers (1–32) represent the key length. With a key length of 5, every fifth rune will be decrypted with the same alphabet.
Note: The darker the cell, the better the prediction. The runes per length columns influences the results of the other columns; so if this is low, the other columns are not reliable.
| IoC-high | IoC-norm | Runes / keylen | ||||
|---|---|---|---|---|---|---|
| ᚠ | ᛠ | ᚠ | ᛠ | ᚠ | ᛠ | |
| 1 | 1.16 | 1.17 | 0.39 | 0.40 | 319 | 319 |
| 2 | 1.16 | 1.26 | 0.38 | 0.48 | 159 | 159 |
| 3 | 1.20 | 1.30 | 0.42 | 0.52 | 106 | 106 |
| 4 | 1.14 | 1.34 | 0.37 | 0.57 | 79 | 79 |
| 5 | 1.19 | 1.34 | 0.42 | 0.56 | 63 | 63 |
| 6 | 1.19 | 1.37 | 0.41 | 0.59 | 53 | 53 |
| 7 | 1.19 | 1.32 | 0.42 | 0.50 | 45 | 45 |
| 8 | 1.19 | 1.45 | 0.41 | 0.67 | 39 | 39 |
| 9 | 1.26 | 1.43 | 0.49 | 0.61 | 35 | 35 |
| 10 | 1.19 | 1.32 | 0.42 | 0.54 | 31 | 31 |
| 11 | 1.18 | 1.49 | 0.41 | 0.64 | 29 | 29 |
| 12 | 1.10 | 1.41 | 0.30 | 0.62 | 26 | 26 |
| 13 | 2.15 | 2.01 | 0.74 | 0.75 | 24 | 24 |
| 14 | 1.15 | 1.45 | 0.36 | 0.58 | 22 | 22 |
| 15 | 1.09 | 1.49 | 0.31 | 0.59 | 21 | 21 |
| 16 | 1.19 | 1.52 | 0.32 | 0.63 | 19 | 19 |
| 17 | 1.16 | 1.44 | 0.39 | 0.55 | 18 | 18 |
| 18 | 1.35 | 1.53 | 0.38 | 0.57 | 17 | 17 |
| 19 | 1.19 | 1.61 | 0.34 | 0.64 | 16 | 16 |
| 20 | 1.35 | 1.61 | 0.45 | 0.58 | 15 | 15 |
| 21 | 1.29 | 1.52 | 0.41 | 0.57 | 15 | 15 |
| 22 | 1.20 | 1.81 | 0.35 | 0.55 | 14 | 14 |
| 23 | 1.65 | 1.82 | 0.26 | 0.59 | 13 | 13 |
| 24 | 1.14 | 1.51 | 0.32 | 0.53 | 13 | 13 |
| 25 | 1.04 | 1.65 | 0.19 | 0.48 | 12 | 12 |
| 26 | 2.21 | 2.00 | 0.57 | 0.60 | 12 | 12 |
| 27 | 1.27 | 1.64 | 0.32 | 0.45 | 11 | 11 |
| 28 | 1.10 | 1.57 | 0.16 | 0.41 | 11 | 11 |
| 29 | 1.33 | 1.74 | 0.29 | 0.47 | 11 | 11 |
| 30 | 1.18 | 1.56 | 0.32 | 0.42 | 10 | 10 |
| 31 | 1.22 | 1.76 | 0.18 | 0.50 | 10 | 10 |
| 32 | 1.10 | 1.95 | 0.14 | 0.40 | 9 | 9 |
| best | 26 | 13 | 13 | 13 | ||
This section explores the idea of multiple alphabet-sets alternating. For example, have two or three Vigenere ciphers that switch after each rune. A Vigenere with key length 3 (ABC) plus another Vigenere with key length 4 (DEFG) will generate a pattern that only repeats after 24 runes (ADBECFAGBDCEAFBGCDAEBFCG). So, the first group will represent every 2nd letter (starting with the first), and the second group will also contain every 2nd letter but starting with the second.
There are two main distinctions. Interrupt-first-then-mod assumes that an interrupt will pause the alternation between the different groups. Mod-first-then-interrupt assumes that an interrupt will pause the key alternation within that group. Lets look at the example Vig(3) + Vig(5). With the first, the decryption sequence is: Vig(3)[0], interrupt, Vig(5)[0], Vig(3)[1], etc. With the second, the decryption sequence is: Vig(3)[0], interrupt, Vig(3)[1], Vig(5)[0], etc. Note that the second decryption still switched to Vig(5) but was ignored because it was an interrupt.
Note: The row header format is {interrupt}.{mod}.{offset}. “ᚠ.2.0” means, assume the interrupt is ᚠ, divide the data into two sets, then look at the first set (rune at index 0, rune at index 2, etc.). The column shows the key length for which the IoC was calculated. In the previous example, with a key length of 7, indices 0, 14, 28, ... are part of one alphabet, and indices 2, 17, 30, ... are part of another alphabet. Both are from the same alphabet-set!
Mod-IoC is disabled on solved pages
This section looks at different ways to extend a short key into a longer one. The result of this expansion is still a plain Vigenere-like encryption but the key is so long that we would not be able to find it with IoC analysis. However, we can use the fact that the same letters appear again and so there are less alphabets than the key length.
The two mirror pattern variants simply flip the key in reverse and append it to the original key. For example, the key ABCD will become ABCDDCBA (Variant A) or ABCDCB (Variant B). Both keys will repeat after that. Notice how the first variant produces double letters (DD and AA) and the second does not.
The shift pattern simply offsets the key by one and appends this permutation to the key. For example, ABCD becomes ABCDBCDACDABDABC. Each key length n (here 4) has n - 1 shifts. The example before was shift = 1. The other two are ABCDCDAB (shift=2) and ABCDDABCCDABBCDA (shift=3). And again, like with the mirror pattern, we greatly increase the key length without increasing the alphabet count.
Note: While the column in the mirror pattern represents the key length, the column in the shift pattern is not the key length. Instead, the key length is given in the row title, e.g., “ᚠ.5”. The column header represents the key shift variation.
Pattern-IoC is disabled on solved pages