|
Lkeas -> RE: =WF= A Final Mystery (7/2/2009 20:08:50)
|
Alright, here's our issue with the monoalphabetic substitution:
Gmkk wig mk kfq.
Yzl, b pzeif zpf wtz omh.
Yzjf wte ibimbh xa wvf wt.
Zzpk uiw pnxf opbq f wtamlzo mh.
Zzh uwa eiz mpre hw rw pzq az azp.
If we isolate all the two-letter words, we have these:
mk xa wt mh hw rw az
We also have the single-letter words "b" and "f". Which we assume will correspond in some manner to A and I, or possibly O. Notice the big problem, though?
There's no "b" or "f" in ANY of the two-letter words. That severely limits our options since we'd have to come up with a set of words without two of the 5 vowels available to us. Notice also the pattern of some of the two-letter words:
hw rw wt mh
If we operate under the assumption that the message is not scrambled, we have to find two-letter words that match the placement of the "w" and "h." There are only a few sets of words that can do this:
so do of as
to so of at
no so of an
so to of is
to so of it
no do of in
There are a few more variations, but notice that all the sets utilize at least two of the 3 vowels we would possibly need for the single-letter words. This isn't going to work.
The words "Zzpk" and "Zzh" have suggested to some that the message might be backwards. In which case we'd have to match this pattern:
wh wr tw hm
So far I can't get anything to match that pattern.
Another possibility is that instead of being forward or backward, the words are in fact scrambled. Which would be near impossible to solve! How would we know if we got the words right? [:@]
Yet another possibility is that each line of the code uses its own substitution pattern. But then it wouldn't be a monoalphabetic cipher anymore, would it?
|
|
|
|
