STEVE: But, I mean, even if it’s not textual, it might be unencrypted binary stuff which just looks like, you know, gibberish of hex junk. But we still call it “plain text” as sort of a term of art in cryptography. And similarly, after we do something to the plain text to obscure it, to encrypt it, it’s then called “cipher text,” again by agreement. So if our inner and our outer secret decoder ring, or modified secret decoder rings, are aligned, we get no encryption. So in order to use this very simplistic encoder, you would twist the rings so that they’re no longer aligned by some amount. Now, another characteristic of this is that there are only 28 possible combinations, that is, 28 possible keys, essentially, for this algorithm because, as soon as you go 28 times, you’re back around to the beginning. But that turns out to be useful, as we’ll see in a minute also. And we already know that one of those 28 provides no encryption at all. So if we rotate our secret decoder ring off to some angle, some number of steps, then the process of encoding is looking up, you know, we write down our message that we want to send. And then, for every character, including periods and spaces, since we have a 28-symbol alphabet on ours, we look up from the outer ring, we find the clear text character, and we look down into the inner ring for the matching cipher text.