Rvalldrgg
Prowler
- Joined
- Jul 5, 2009
- Posts
- 1,175
- Location
- Michigan, USA
- Society
- Synergen
- Avatar Name
- Rvalldrgg Ugly Xerx'iq
and another:
There is one sort of encoding I currently find any info about, it's called "z-base-32". Maybe it's something to try. (Unfortunately it's getting late here, and I need to get up at decent time tomorrow.)
On the most obvious level, the key word could be Hydra?
I'm thinking that maybe you are onto something if you think about it..
Here are some facts according to Wikipedia and some Greek Mythology I dug up
The Hydra was an ancient nameless serpent-like chthonic water beast (as its name evinces), that possessed seven heads — and for each head cut off it grew two more — and poisonous breath so virulent even her tracks were deadly.
The article goes on with this note.. and this is where it gets interesting:
The Hydra was the offspring of Typhon and Echidna
Typhon (The War Titan spacecraft), and Enchidna (?) As in Camp Enchidna?
Also Hydra is a seven headed monster.. So maybe some sort of cryptological shift might have been made.. with the code being shifted either 7 letters to the left or right
Thus the Cipher might be as follows if the code has been shifted seven letters to the right:
A becomes H
B becomes I
C becomes J
D becomes K
E becomes L
F becomes M....
(And so on) until you get to
Z becomes G
Conversely, if the code has been shifted Seven letters to the Left, The end result would be
A becomes T
B becomes U
C becomes V
D becomes W
E becomes X
F becomes Y
G becomes Z
H becomes A....
etc, until we get
Z beomes S
I mean it is possible that the robots might have learned to shift coding around not in binary form but rather in cipher shifts dealing with groups of 7 (Hence the Hydra heads)
I mean we have to start thinking outside the box here I feel
Also the keys might also be either Typhon, or maybe Enchidna
At least try those theories out too
Benjamin Ben Coyote a.k.a. "The Blind Sniper"
0111100011001010001111001010010010010000000110010111101000010010010010010010001101100100100110111100111001000100101110110011001000010000
101000101101110111100110010000001001001001001001000000011001011110100001001001001001001000110110010111011000
000011001000001001011010001010101100000
0x78CA3CA490197A12492365D83912ECC843
0x0C825A2AC1
0x78FA61A44B406C8452464A8CB23ED329BC3B107993D4E2D
0x786E518D04F5389550E779B48AA184A09C554273C0FC3D3F0F432CBC6D526D8A48C9519
0x786E518D04F538939E01CEF36915430B1657B491818AC1F87A7E1E865978DAA4DB149192A33
0x786E518D04F538D926F39DE6D22A86161A248C823031583F0F4FC3D0CB2F1B549B6292325467
0x0C825A2AC1
report code protocol four activatedCode:0111100011001010001111001010010010010000000110010111101000010010010010010010001101100100100110111100111001000100101110110011001000010000 101000101101110111100110010000001001001001001001000000011001011110100001001001001001001000110110010111011000 000011001000001001011010001010101100000
migrate to code protocol five
endofline
report code protocol five activatedCode:0x78CA3CA490197A12492365D83912ECC843 0x0C825A2AC1
endofline
request time and location for future hydra trialsCode:0x78FA61A44B406C8452464A8CB23ED329BC3B107993D4E2D 0x786E518D04F5389550E779B48AA184A09C554273C0FC3D3F0F432CBC6D526D8A48C9519 0x786E518D04F538939E01CEF36915430B1657B491818AC1F87A7E1E865978DAA4DB149192A33 0x786E518D04F538D926F39DE6D22A86161A248C823031583F0F4FC3D0CB2F1B549B6292325467 0x0C825A2AC1
response trial two august twentieth two three zero zero at previous location
response trial three august twenty first one nine zero zero at previous location
response trial four august twentysecond one nine zero zero at previous location
endofline
Legion just look at the old intercepts and youll get an idea what might be in the intercept
for example the endofline is a good start
then you soon notice that e = 000, n = 01100, d = 10000, o = 0100, f = 101101, l = 00010, i = 101 and so on, just a bit of guessing is needed and lots of patience
0×9E6064229232546591EEC41E64F538939E01B21649BF
0×8A48C9519AC7
0×0C825A2AC1
update location for hydra trial three and four
location by
endofline
e<--000
t<--0010
a<--0011
i<--0101
o<--0100
n<--01100
s<--01101
h<--01110
r<--01111
l<--10001
d<--10000
u<--10011
c<--10010
m<--10100
w<--10101
f<--10110
g<--10111
y<--11000
p<--11001
v<--11011
b<--11010
k<--11100
j<--11101
x<--11110
q<--111110
z<--111111
Here is how it works:
First, a reference between binary codes and characters:
If you look at the translation I did, you should be able to figure this out by comparing the original code with the cleartext.
Code:e=000 t=0010 a=0011 i=0101 o=0100 n=01100 s=01101 h=01110 r=01111 l=10001 d=10000 u=10011 c=10010 m=10100 w=10101 f=10110 g=10111 y=11000 p=11001 b=11010 <--? v=11011 q=111110 z=111111
"Protocol version 4": You encode the letters, using the binary values above.
For instance, "ET" is encoded into 000 0010. I just added space for clarity, it's not a part of the original code.
"Protocol version 5": You take the code from protocol version 4, group them in groups of 4 (ofc). If last group isn't complete, then you add "1"s in the end (to the right), at the most 3 of them; and then you encode each group using the hexadecimal number system 0-F; 0001=1, 0010=2, ... 1111=F. The padding doesn't cause any problem because there is no letter "1", "11" or "111".
So,
Cleartext: ET
Version 4: 000 0010 => 0000010
Version 5: 0000 0101 => 0x05 (Last 1=padding to fill group).
How to decode messages: Just go the other way using the table above.
Step one (for "version 5"):
Convert hexadecimal to binary:
0x05 => 0000 0101. From now on treat it as a single string (no space).
Step two (begin here for version 4)
Use the table above to translate from binary to clear text. Note that there is no ambigouty - for "000", there is only one match, letter "e". There is no letter that begins "0001", for instance.
So, 000 => "E", "0010" => "T". Now there is a "1" left, you realize there is no letter that only has one "1", and knowing the code is padded with 1:s in the hexadecimal coding, you discard that "1" as padding junk.
A warning, during decoding: Though it's unambigous from left to right, it's *not* unambigous from right to left, if there is characters in the middle you don't know the length of.
Let's say the binary string has <a combination of 001010 you can't interprete>11001111000. Then you have to realize it can be, for instance, both "10"+uy (for instance a part of "buy", not unreasonable since the "b" character isn't confirmed) or "re" (for instance as in "are").
Because the "b" character has ony appeared once and only in the last code, I can't say for sure the code given in table is indeed the code for "b".
As for programming, I used my standard programming language for it. I haven't done any web version yet of it though (the previous version is on my web page, you can view the source to see how the earlier version worked).
http://web.comhem.se/~u77771572/aia/convert/convert6c.html
(note: only works under Internet Explorer but you can view the source to see how it's made.)
So is this Hydra thing finished for good? or is it coming back again today?
hmmm then im confused now, the link you posted asks for a key and it wont decode without it or is that particular one for the old robot encryptions?
const symb2 = "0123456789abcdef"
codetable(1) = ".....z....qazqaz" 0_
codetable(2) = "..........wsxwsx" 1_
codetable(3) = "..........edcedc" 2_
codetable(4) = "..........rfvrfv" 3_
codetable(5) = "..........tgbtgb" 4_
codetable(6) = "..........yhnyhn" 5_
codetable(7) = "..........ujmujm" 6_
codetable(8) = "..........ik,ik," 7_
codetable(9) = "..........ol.ol." 8_
codetable(10)= "..........pö-pö-" 9_
codetable(11)= "poiuytrewq......" a_
codetable(12)= "ölkjhgfdsa......" b_
codetable(13)= "-.,mnbvcxz......" c_
codetable(14)= "poiuytrewq......" d_
codetable(15)= "ölkjhgfdsa......" e_
codetable(16)= "-.,mnbvcxz......" f_
alfa="abcdefghijklmnopqrstuvwxyz"
0x7620F327A9C5A55424B24DED9CA41ADB4E3
0x60F10DA4664A8C25A0691D32550C2C5926F272302307E1E9 F87A4CA5
0x8A48C951816EE26AF8AA9AC05BB8BF0F468D867
0x39718958885C43
0x0C825A2AC1
0x388797
0x7FA6C52322AAB320F8D
0x6CDB9122924065E849248AB2C8FA192A309E6C6D14884093 4A914BAC8E2D
0x0C3D4449203830F5938DF0A9DD81F
0x39718958885C43
0x0C825A2AC1
0x39718958885C43
0x0C825A2AC1
0xE5E0708C8F4FA22FD
0xDD49AEC2234AD35FB
0xA5A1CC369D6F
For reference, since "everyone" is asking when the robots comes...
Ahh, and I wasn't the first one to decode the first ones this time. Tugaroo was ahead of me! https://www.planetcalypsoforum.com/forums/robot-wars/195296-attention-decoders-4.html#post2535477
- Keyword for searching: giraffmutant
http://web.comhem.se/~u77771572/aia/convert/convert6c.html
(note: only works under Internet Explorer but you can view the source to see how it's made.)
doesnt like meWebpage error details
Message: Invalid procedure call or argument: 'mid'
Line: 74
Char: 3
Code: 0
URI: http://web.comhem.se/~u77771572/aia/convert/convert6c.html
doesnt like me
0xD756A2947B4BFFAF8F46B0
0x3A97CA92FECF13A310CFD
0xD1D0E26161C739F7D30ED93DBCF5FE1D07CEAF0C76BD8
0x2BCAB4CB7ADFDFCF5A368D793B289E04943CEBB3BF
0x59F3AE864DFECDF
0xA5A1CC369D6F
try image properties or look at source. end of the world is the title tag. this is in the alt tag.
ok ive spent 5-6 hours now trying to figure exactly how this works all i got now is a bad headache.
is there a way you can break this down how you decoded this exact message? I am trying to write a nice program that decodes everything
how does A5A1CC369D6F become endofline ????
i need to meet up with you so we can chat
Example again (bad example but anyway) the code string "helloworld" when *de*crypted with the key "ababab" becomes "hdlkovoqlc".Version 3b
Version 3 encrypted with password where letters are shifted for letters b-z in password; for letter b one step, for letter c two steps and so on.
Example:
Key: "muspelheim"
Codetext: "3d7ac32fe4a48e0e8ea9b4c7d34a"
preparing hydra trial seven0xF7444B14ECF1DBED95FCCDD18FE7A
0xD1D0E26161C739F7D6CD993DBCF5FE1D07CEAF0C76BD8
0x2BCAB4CB7B219DAABB7C529DBD0B6F3250F33F7
0x59F3AE864DFECDF
0xFEBF7DEFFD89011793B73C4439FA929BEB68F6019F65F96AFCEDBFEE57
0xFEBF7DEFFDFB4139D
0x38AB875ACB5A8FDB2BF5AFF918
0x345CED3DC6864E52AFD765FD6567FAFDCFDF7
0xA5A1CC369D6F