Mind candy.
Looking for a little help in narrowing down a puzzle.
Basically, it's for a game (Perplex City for those of you who know it)...there are currently 4 unsolved cards, one of which I think I can do if I can narrow things down a little more.
It's a card-based cipher 108 characters long, with a key of indeterminate length.
I think I can bypass most of the issue (through kind of brute force, but with more finesse) if I can narrow down my criteria for what would pass in a section of extracted language (like CTEDLAN would be from that phrase), I'm figuring min 33% vowels 33%consonants, limiting certain combinations (like AA or Q without the U, dropping any Z entirely). Looking for ways to narrow down what I have to look through, since I'm planning to grab 2 sections 7 characters long (this would check for a 7,8,or 14 character key in one shot {offset 56 characters}, then going to try 5/10/15/20/30 since 6,9,18,27 would be brutal....)
er, so anyways, can anyone give me advise on ways to limit it further?
If you want to look at it yourself, the encoded string is:
WBBMC HGFIB LXCQY WEZFL ITHPJ LFHWY ETKWY LJOTY YNGYJ BIOGI FUVMR
XIHGU RAGXH NQHRS XAWHU FJTAM SMMOS MVBAA KPGVV WXOVM YKZPL LUL
Edit: Um, after writing a basic program and seeing the sheer volume of calculations this things going to need to do, I need to go back to the drawing board or spend the rest of my life looking at this funny...
hmm, may have an idea that'll work a LITTLE better, but still need more...
Basically, it's for a game (Perplex City for those of you who know it)...there are currently 4 unsolved cards, one of which I think I can do if I can narrow things down a little more.
It's a card-based cipher 108 characters long, with a key of indeterminate length.
I think I can bypass most of the issue (through kind of brute force, but with more finesse) if I can narrow down my criteria for what would pass in a section of extracted language (like CTEDLAN would be from that phrase), I'm figuring min 33% vowels 33%consonants, limiting certain combinations (like AA or Q without the U, dropping any Z entirely). Looking for ways to narrow down what I have to look through, since I'm planning to grab 2 sections 7 characters long (this would check for a 7,8,or 14 character key in one shot {offset 56 characters}, then going to try 5/10/15/20/30 since 6,9,18,27 would be brutal....)
er, so anyways, can anyone give me advise on ways to limit it further?
If you want to look at it yourself, the encoded string is:
WBBMC HGFIB LXCQY WEZFL ITHPJ LFHWY ETKWY LJOTY YNGYJ BIOGI FUVMR
XIHGU RAGXH NQHRS XAWHU FJTAM SMMOS MVBAA KPGVV WXOVM YKZPL LUL
Edit: Um, after writing a basic program and seeing the sheer volume of calculations this things going to need to do, I need to go back to the drawing board or spend the rest of my life looking at this funny...
hmm, may have an idea that'll work a LITTLE better, but still need more...