"I looked for patterns with the usual Cryptonomicon techniques. Found nothing clear—just some traces. Finally, in complete frustration, I decided to start from a clean slate, trying to think like Alan Turing. Typically your approach is to reduce a problem to numbers and then bring the full power of mathematical analysis to bear on it. So I began by converting the messages into numbers. Normally, this would be an arbitrary process. You convert each letter into a number, usually between one and twenty-five, and then dream up some sort of arbitrary algorithm to convert this series of small numbers into one big number. But this message was different—it used thirty-two characters—a power of two—meaning that each character had a unique binary representation, five binary digits long."