to the encrypted message. If 6 of those can be replaced by a single character each, that leaves 84 that are probably a combination of characters.
84 can be evenly divided by 2, 3, 4, 6, or 7.
I'm going to assume that the characters aren't a number of bits not divisible by 256. If it was, we wouldn't get such consistent symbols here.
Like you showed, breaking the text into sets of 3 doesn't work. It also doesn't work breaking it into sets of 2 for the same reason.
There are 16 symbols before the first set of (). There are eleven symbols between the first and the second.
There are no common denominators between 16 and 11.
So my current theory is that the number of symbols per real letter is not consistent. Some are 1, some are 2, and some are 3. |
