magnesium wrote:qokeedy qokeedy qokedy qokedyActually, this is quite interesting. In this setup, the cipher takes on a different form — the letters represent digits, and combinations of similar symbols are numbers. Then repetition elements like ch (which I call nulls) can serve as an auxiliary sign indicating that a digit belongs to a specific number.
Could encrypt something like the Roman numeral MMXX.
This is something to ponder. So, qokeedy qokeedy qokedy qokedy = MMXX. But what then is okedy? This could be the same X, but as a number, not just a single digit. For example, qokeedy qokeedy okedy = MX X.
Overall, we run into the same issue with the numerical cipher — a single number can be expressed using different methods. But then we lose all sorts of possible clues (in the form of i = one, for example), and the cipher becomes... virtually unbreakable.
Essentially, this turns into a book cipher, or there’s some kind of algorithm that allows you to extract numbers from these words (maybe qokeedy is a set of numbers that add up to M).

