29-12-2016, 12:52 PM
Instead of focussing on direct results, I was wondering if we can create a small list of patterns or methods we would like to see.
For example the Roger Bacon cipher works with blocks of 5 letters. So I would have loved to find a way to make blocks of 4, 5 or 6 letters.
Helas, that is not possible.
Another method: take the first letter, then the second, then the third, then the third etc.
All those methods have one big flaw: even when you do work like that, the letters must add up to an alphabet. That alphabet must contain al least 22 variants and the frequency must add up or the letters must have a variation of about 10. Ten because of the digits 1......10. With those digits we can recreate all the letters we want because 10+9=19 for example.
Let's consider that system, 1-to-10. What would be the function of wordlengths in such a system? Logically the length would give 1 letter. That is not really convenient, from the knowledge point that we have an average of 5 a 6 word length. There would be an enormous amount of Nulls. Or is it still plausible.
It is more probable that a word contains more letters, for example the letters are always groups of 2. But then we have a problem with all the singles letters.
Also it is not logical that there are so little double letters. At least very few letters You are not allowed to view links. Register or Login to view.. (almosty only ee and ii exist)
Are there more possible systems? Yes, we can take a special character such as a gallow or the 4o or the c_c as a "signal"-character. Or the last and/or the first letter of a word.
Although the 4o does not occur on one page, wasn't it f2, that could signal us to take a particular transposition table.
In general there are 12 letters as first letters and 9 last letters. The most striking and highest occurrences are there for o h and y.
If we would use grouping for letters we could take o a e c or o c a y which You are not allowed to view links. Register or Login to view..
But then what? We can also use the gallows and assume all other words are nulls. But what transposition table must we now use. Any suggestions?
There is also a more complex grouping, similar to thomascoon his work, although I hesitate to apply such grouping because it seems it bit too artificial and over-constructed.
Using n-grams as elements does also make the text very small. And also there are the labels. A label of two or three characters then translates to one character or simply one digit.
Of course it is possible that the labels are not descriptive but read a line of text scatted throughout the labels (such as: david was here) but then the labels would follow a particular line or a more flowing pattern, like an invisible banner.
For example the Roger Bacon cipher works with blocks of 5 letters. So I would have loved to find a way to make blocks of 4, 5 or 6 letters.
Helas, that is not possible.
Another method: take the first letter, then the second, then the third, then the third etc.
All those methods have one big flaw: even when you do work like that, the letters must add up to an alphabet. That alphabet must contain al least 22 variants and the frequency must add up or the letters must have a variation of about 10. Ten because of the digits 1......10. With those digits we can recreate all the letters we want because 10+9=19 for example.
Let's consider that system, 1-to-10. What would be the function of wordlengths in such a system? Logically the length would give 1 letter. That is not really convenient, from the knowledge point that we have an average of 5 a 6 word length. There would be an enormous amount of Nulls. Or is it still plausible.
It is more probable that a word contains more letters, for example the letters are always groups of 2. But then we have a problem with all the singles letters.
Also it is not logical that there are so little double letters. At least very few letters You are not allowed to view links. Register or Login to view.. (almosty only ee and ii exist)
Are there more possible systems? Yes, we can take a special character such as a gallow or the 4o or the c_c as a "signal"-character. Or the last and/or the first letter of a word.
Although the 4o does not occur on one page, wasn't it f2, that could signal us to take a particular transposition table.
In general there are 12 letters as first letters and 9 last letters. The most striking and highest occurrences are there for o h and y.
If we would use grouping for letters we could take o a e c or o c a y which You are not allowed to view links. Register or Login to view..
But then what? We can also use the gallows and assume all other words are nulls. But what transposition table must we now use. Any suggestions?
There is also a more complex grouping, similar to thomascoon his work, although I hesitate to apply such grouping because it seems it bit too artificial and over-constructed.
Using n-grams as elements does also make the text very small. And also there are the labels. A label of two or three characters then translates to one character or simply one digit.
Of course it is possible that the labels are not descriptive but read a line of text scatted throughout the labels (such as: david was here) but then the labels would follow a particular line or a more flowing pattern, like an invisible banner.