# Difference between revisions of "153: Cryptography"

 Cryptography Title text: If you got a big keyspace, let me search it.

## Explanation

This comic refers to the study of cryptography. We can note the presence of the International Association for Cryptologic Research (IACR) logo in the lectern, an association that organizes the most important conferences in the cryptology field. Cueball, behind the lectern at the podium, is describing a proposed crypto system in which a computer program turns a very large number, called the "key," and a message into an encrypted form that can only be read by using the same key, based on the model of a Feistel cipher. Part of any Feistel cipher is the "round function," which determines how the key is applied to the original message; this is applied multiple times with a variety of tricks and techniques to ensure that the process can eventually be reversed. One common component of round functions is the S-box, a simple table that converts input bytes into output bytes, preferably in a way that doesn't correspond to any mathematical rules.

Here, the S-box would be implemented by doing the following (with the computer operation actually shown in the diagrams indicated in parentheses):

1. Take the bitstring down (roll right by 1)
2. Flip it (take its binary NOT)
3. Reverse it (run the bits in the opposite order)

This would be run on each round of the cipher to further scramble the message for the next round. As the caption implies, the steps are based on a line from the Missy Elliott song Work It: "I put my thing down, flip it and reverse it." As with any encryption system, there must be a way to decrypt the cipher text. In Missy Elliott's song, the phrase "I put my thing down, flip it and reverse it" is repeatedly played backward, sounding like gibberish. In the same way, steps to a Feistel cipher-based algorithm are executed in reverse to obtain the original plain text from a cipher text.

The keyspace for a cryptographic algorithm is the number of possible keys the algorithm can possibly accept. For example, AES-256 has a keyspace of 2256 (roughly 1.1579209e+77) possible keys, simply because the algorithm specifies that each key is 256 bits wide. The title text is referring to "searching a keyspace," which is to say, simply trying every key until you find one that works. (For reference, a computer would require roughly the energy of a billion billion supernovas to even count to 2256, let alone actually try each one.) The precise wording, "If you got a big keyspace, let me search it" is, of course, another reference to the same song: "If you got a big **** let me search ya" (The word "penis" is censored by the trumpeting of an elephant).

### Inside references and real life shenanigans

Cueball is banned from multiple conferences for similar pranks in 541: TED Talk. In response to 541, PyCon organizers jokingly announced that Randall Munroe was banned from PyCon 2009 due to "last year's disgraceful keynote, 'Web Spiders vs. Red Spiders'." They also said they instructed their volunteers to refuse admission to him and "any stick figures who may attempt to register, particularly if they are wearing hats."

Messages on the PyCon-Organizers mailing list show that this joke was intended to get Randall to come to PyCon: (The links will only work if you're subscribed to the mailing list.)

PyCon mentioned briefly in today's xkcd:
http://xkcd.com/541/
We've still never gotten Randall Munroe to actually attend, have we? Anybody want to take charge of twisting his arm this time? I think we can still offer him a "press pass" (free registration). [...] [1]
An invite would seem most appropriate given the cartoon. :-)
We could also have an official PyCon blog post confirming his ban... [2]
How about a public blog post LIFTING the ban and inviting him? [3]
Confirming the ban is far funnier... He's definitely a disturbing influence on programmers. [4]
Agreed, especially if we invite him concurrently with confirming the ban. [5]
(a few posts later)
I'm happy to participate in actually throwing some thin guy out of the conference, and then get some graphics savvy person to animate a stick figure over that. :) [...][6]
here's a rough idea of what would show up if you invited him to actually do any speaking...
it's fairly long. he shows up in the beginning around 3:25. [7]
For the record, I did try to convince him to come when got the art for the tshirt last year. He didn't seem super psyched, but then again emotions are hard to read via IRC.
I love the idea of "officially" banning him, however. ;-) [8]
(a few posts later)
OK - posted to the PyCon blog, by the power vested in me as publicity chair. With Michael Foord's excellent sentence added.
Now let him know that since he's banned, he HAS to come. [9]

## Transcript

[Randall Munroe (drawn as Cueball) stands behind a lectern on a podium in front of a large conference audience (consisting of Cueball heads), with a poster hanging beside him.]
Randall: My cryptosystem is like any Feistel cipher, except in the S-Boxes we simply take the bitstring down, flip it, and reverse it.
Decryption
`01101010`
`   >>`
`00110101`
[inverter symbol]
`11001010`
[crossed arrows]
`01010011`
[Caption below the crowd:]
I've been barred from speaking at any major cryptography conferences ever since it became clear that all my algorithms were just thinly disguised Missy Elliott songs.

# Discussion

I think that executing that S-box twice would get you back where you started. gijobarts (talk) 05:28, 30 July 2013 (UTC)

Actually that's not true. Regardless of the bit in position 1 to begin with, you will always have a 1 in position 8 in the result. When you shift, you're adding a 0 in position 1 (assuming a 0 shift in), then the inverse is 1, and flipping would put the 1 in position 8. Jarod997 (talk) 14:06, 5 March 2014 (UTC)
I was expecting the last bit to wrap around to the front. It could go either way. gijobarts (talk) 05:57, 6 March 2014 (UTC)
I think it would actually take a few rounds, but yes will eventually get back to the same as the input. Remember that you aren't just doing this operation, you are doing it to one half of the block and then XORing with the other half of the block. But yes I think after a few rounds the XOR's would combine to the identity. (assuming that it wraps, which makes sense to me). Also it is not shown at all how the key would be incorporated into this... so maybe that would help? (or you just add a round key in after doing this operation?) 108.162.218.142 16:32, 18 November 2015 (UTC)

" and so is the author Randall Munroe at PyCon"

I think that post is a joke.
• It links to 541: TED Talk.
• It says "Registration volunteers have been instructed to refuse admission to Randall Munroe personally, and in fact, to any stick figures who may attempt to register"