Timeline for Meatsacks, please help us decipher this code
Current License: CC BY-SA 3.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 6, 2016 at 8:48 | comment | added | Sumurai8 | The code consists of a concatenation of sequences encoding single letters. It appears our subject did not know how to use punctuation, and communicated in English before expiring. | |
| Sep 5, 2016 at 22:54 | comment | added | 2012rcampion | @Sumurai Based on your comments, can we take it as given that the cipher encodes single letters and is monoalphabetic? (And doesn't have a transposition component?) | |
| Sep 3, 2016 at 10:51 | comment | added | user27395 | I have a stern feeling that the cipher, which is extracted from our friend meatsacks head, is probably coded in variable:1 . I ain't sure, but it is probably so. | |
| Sep 3, 2016 at 8:02 | comment | added | Sumurai8 | n:1 substitution is "take n characters from the input and replace it with 1 character in the output". ASCII is a range of numeric values (or hex values) that actually represent readable characters. Taking 2 characters from the input is enough to encode every character between a through z, so "interpreting as ascii" can actually be seen as a 2:1 substitution cipher. | |
| Sep 2, 2016 at 23:53 | comment | added | user27395 | @Sumurai8 Some meat sacks are stupid, and I am one of them. What's is 2:1 substitution ? Converting 2- long groups to one letter ? Then how ASCII is that ? | |
| Sep 2, 2016 at 16:14 | comment | added | Sumurai8 | @ArkaKarmakar We did just tell some other meatbag something that might interest you. We did only brute-force all 1:1 and 2:1 substitution ciphers, and failed to find any meatspeak sentence. There may be n:1 or variable:1 substitution ciphers as we have not tested those. | |
| Sep 2, 2016 at 11:31 | comment | added | user27395 | @Sumurai8 I analyzed got a very rough exponentional graph (negative) as the result, denoting in the whole string max occurrences of a sub string i letters long. It doesn't repeats after letter length > 22. I am not poking for hints, but do you, the meatsack experimenters, a. Did brute forced it for string for substitutions with lengths > 2 ? b. (Don't reply,if this gives away major hint) Except substitution, did you check any other method of converting i-long pairs to meatspeak sentence ? I mean, did you check, all the possibilities of converting a i-long word in any rule to meatspeak ? | |
| Sep 2, 2016 at 7:20 | comment | added | elias | Yeah, @Sumurai8 got the point. If none of the substitutions have worked, it means that the special case of ASCII conversion was checked as well - and proved to be wrong. | |
| Sep 1, 2016 at 20:17 | comment | added | Sumurai8 | "Interpreting as ascii" is actually a 2:1 substitution cipher. A very strict one at that. | |
| Aug 31, 2016 at 20:36 | comment | added | elias | @user52587, I have serious doubts if that will work, because low-range ascii codes are typically non-human readable, as far as I can recall, and this text is full of those. Maybe with some modifications that could work though. | |
| Aug 31, 2016 at 19:09 | comment | added | dalearn | What about interpreting them as ascii? I don't have the time to do all of the conversions right now but I would guess that the numbers correlate to unicode or ascii values! | |
| Aug 31, 2016 at 8:26 | comment | added | Sumurai8 | We have gone ahead and brute-forced all possible substitutions of pairs with meatspeak characters for you, and we have not found viable meatspeak sentences. We however do believe that analysing pairs initially might be a viable approach. Have an imprint of a furball as a reward: c1.staticflickr.com/7/6195/6157871473_d4b4b0f00d_b.jpg | |
| Aug 31, 2016 at 8:10 | comment | added | elias | Well, if I am completely off the track, that would be good to know. But I don't want to make you feel forced to hint anything I've not found yet. Thanks! | |
| Aug 31, 2016 at 8:03 | comment | added | Sumurai8 | Greetings meatsack. Would you like us to evaluate the viability of your approach? | |
| Aug 31, 2016 at 7:52 | history | answered | elias | CC BY-SA 3.0 |
