Cool challenge although I still don't know how it works.
Fido
Make money fast
Make money fast
I don't know how the cipher works but spammimic told me the solution.
Cool challenge although I still don't know how it works.
Fido
Cool challenge although I still don't know how it works.
Fido
-
dangermouse
- Posts: 89
- Joined: Sun Jun 05, 2011 8:14 pm
- Location: deep space computing AG
- Contact:
Probably some bits of plaintext are hidden in the numbers: e.g. Senate bill 1627 ; Title 6 , Section 303
Other bits could be hidden with different preambles, phrases or with a particular grammar:
Prof Jones who resides in Alaska with Jones=1 and Alaska=0
could be also
Prof Wes who resides in Seattle... with Wes=0 and Seattle=1
i did not do any deep analysis though.
Or am i wrong?
Other bits could be hidden with different preambles, phrases or with a particular grammar:
Prof Jones who resides in Alaska with Jones=1 and Alaska=0
could be also
Prof Wes who resides in Seattle... with Wes=0 and Seattle=1
i did not do any deep analysis though.
Or am i wrong?
-
AMindForeverVoyaging
- Forum Admin
- Posts: 497
- Joined: Sat May 28, 2011 9:14 am
- Location: Germany
Well that one went super fast.
1.) Googled for "encrypt message in spam"
2.) First hit I got is http://www.spammimic.com/
3.) Copied'n'pasted the text there
4.) Hit "decode"
5.) Done in a minute.
1.) Googled for "encrypt message in spam"
2.) First hit I got is http://www.spammimic.com/
3.) Copied'n'pasted the text there
4.) Hit "decode"
5.) Done in a minute.
Basically, the method consists of a predefined Huffman tree and a non-ambiguous context free grammar in Greibach normal form.
Take the following production:
noun -> Johnny | Drake
When parsing a text, whenever Johnny is found in place of a "noun", a 0 is noted (first choice); whenever Drake is found in place of a "noun", a 1 is noted (second choice). Thus, the spam message yields a sequence of bits that are then decoded using a Huffman tree.
Unfortunately, the grammar on SpamMimic is not disclosed.
However, for anyone interested, this is roughly how the method works.
Take the following production:
noun -> Johnny | Drake
When parsing a text, whenever Johnny is found in place of a "noun", a 0 is noted (first choice); whenever Drake is found in place of a "noun", a 1 is noted (second choice). Thus, the spam message yields a sequence of bits that are then decoded using a Huffman tree.
Unfortunately, the grammar on SpamMimic is not disclosed.
However, for anyone interested, this is roughly how the method works.