forveux wrote:
So we are therefore relying on obfuscation through a cipher. Correct? And since the 'skyscrapers' could be deemed at opposite ends of the HEX chart, could it be a substitution cipher?
Yes and no.
Meaning that you are:
See:
http://www.exploratorium.edu/brain_explorer/images/jumping2.gif
What you know now is that a "normal", "plain", "unencrypted" text has around 26 (or a few more) tallish buildings one next to the other and possibly another 26 or so smaller buildings also one next another.
On the other hand the object of the test has these gaps between "couples" of skyscrapers (and actually all the landscapes are shifted way to the right), but still if you count the total number of the buildings in your sample text and compare that number with the amount of total buildings in the encrypted text they will result similar.
So, in the original you have something *like*:
1,2,3,4 ....
and in the test text you have something *like*:
100,101, 104,105, 106,107
Try answering just the asked question for the moment:
Quote::
Which kind of algorithm do you think you may apply to mytest.txt to transform it's "skyline" view in such a way that is more similar to your crypted file?
How can you obtain the second series from the first?
Like can you just multiply the first set of numbers for a fixed multiplier?
Or can you add a fixed amount to each term of the first series?
Or can you elevate all terms of the first series to (say) the power of 2?
Etc....
Remember that you know nothing of what has been used to encrypt the original text, so you need to explore possibilities in a logical way, one step at the time while being ready to change hypothesis, but you should always start from the simpler ones.
jaclaz
↧