If you read down in a snaking sort of fashion, you can get: DONT CRY LIKE HUG
With some punctuation: Don't cry. Like hug?
aspragg wrote:I'm a little surprised the brute-force attack on the 6th key didn't work. Any ideas why not?
Now that the whole key was discovered, I was able to create a brute force attack which worked, but it's a lot easier to do once you know what results you want.
sam@skynet:~/python/xkcd$ openssl aes-256-ecb -d -iv 00000000000000000000000000000000 -K EE98511873CD4542DA101CBC735646B09BE32BE0D0E0C9A6CB4D62AE8662384F -in ciphertext
16375:error:06065064:digital envelope routines:EVP_DecryptFinal_ex:bad decrypt:evp_enc.c:461:
<3<3<3 2010-06-26 14:28:57 37.76sam@skynet:~/python/xkcd$
Sentynel wrote:There was a revised version of the brute force released which I confirmed worked with a test message.
I guess the failure of the brute force is related to the problems I'm having decrypting the text. I'm not sure what's going wrong, so here's a console log
aspragg wrote:For what it's worth, when I did this in C#, I had to specify a particular padding type, or I'd get this error:
"Padding is invalid and cannot be removed."
I had to specify the Padding as PaddingMode.Zeros. Not sure how that translates to openssl, but FYI.
Sentynel wrote:Spoiler:Where ciphertext contains, in hex, 772A3A35DEF88CA70BDFD18620B05684934721F8F64762FD03F8D76B3FA0CB8C2756B2D0A9F00A1BCFF1603EDB05426C
I'm not sure if I'm doing anything wrong there (that command works fine for my own tests), but if not whatever's going wrong would also have caused the brute force to fail, as that uses the host computer's openssl library.
danm wrote:The source needs to be binary, not hex. It can also be ASCII-armored in base-64 if you use the -a switch. You need to convert it with something like:
echo -n -e $(sed 's/../\\x&/g' ciphertext) >ciphertext2
and then decrypt ciphertext2.
ethan1701 wrote:Posting your home address to a public forum (even of loving, trustworthy XKCD fans) is a bad idea.
I'd suggest you alter the starting point to a public location near your home.
ameretrifle wrote:Magic space feudalism is therefore a viable idea.
skeptical scientist wrote:8. (page 10020) The comic on this page is #240, incase it's connected.
- Code: Select all
772A3A35 DEF88CA7 0BDFD186 20B05684 934721F8 F64762FD
03F8D76B 3FA0CB8C 2756B2D0 A9F00A1B CFF1603E DB05426CUnsolved.Spoiler:This is the 256-bit AES cipher referenced in the code on page 11.
That comic holds a special place in Randall's heart, as he explained in the intro (and elsewhere). Also, this code seems to be the focus of several other codes in the book, so it seems important. I'm guessing that deciphering this code, when deciphered, will lead to another meetup or other real-world happening. That could mean there's a time limit on it, but hopefully Randall will have made it far enough in advance that we have some time.
Two things have changed between this comic and the original. The coordinates went from 42.39561 -71.13051 2007 09 23 14 38 00 to 42.39561 -79.13051 2007 09 23 02 38 00, and the conversation on the last panel changed completely. I'm not sure what either of these changes might mean; possibly deciphering the encrypted message might provide some clues.
If P AND NOT P then the lotto numbers will be 4, 19, 23, 194, the fine structure constant, and Birmingham.
Adacore wrote:Kudos on solving it, guys! Unfortunately, I'm on the wrong side of the world, but I hope those that can be there have a blast!
Kimmel wrote:In case you are wondering about the page numbers, I can explain:
Kimmel wrote:In case you are wondering about the page numbers, I can explain:Spoiler:http://en.wikipedia.org/wiki/Ternary_numeral_system
It's in trinary! Yep, that's right! It's just like binary, but as binary is to two, decimal is to three, and hexadecimal is to 16, trinary is to three! Example:
0, 1, 2, 10, 11, 12, 20, 21, 22, 100, 101, 102, 110, 111, 112, 120, 121, 122, 200, 201, 202, 210, 211, 220, 221, 222, 1000