Philosophically Secure

A distributed computing project known as GIMPS (The Great Internet Mersenne Prime Search) was used to discover the 45th and 46th Mersenne prime numbers. These are huge numbers, with way more digits than the human mind can really grasp the size of. Every time something like this happens, I’m reminded of the incredible reliance of cryptography on prime numbers. Obviously, numbers this big are not exactly useful, but the process of discovering them could teach us something about primes in general. In any case, it’s an interesting mathematical achievement.

Some of the press coverage I’ve seen has been wrong, giving credit to UCLA mathematicians, when it was really just a computer that happened to be in UCLA, which was connected to the GIMPS network. GIMPS has thousands of computers from volunteers all over the world working on the problem simultaneously.

(2^37156667-1)  and  (2^43112609-1)  are both prime!

Bruce Schneier talks about a paper he helped write with a few other researchers on breaking the deniable encryption feature of TrueCrypt.

The claim behind this feature is that you can have a secret encrypted file system that will remain undetected, and so you can deny its existence if your drive is confiscated somehow. Schneier and the other authors prove that this deniability is rather weak. Since the encrypted file system is stored and used within a normal operating system (Windows, Linux, etc.), traces of its existence are scattered throughout the unencrypted parts of the hard drive. There are swap files, temporary files, and other remnants created by various applications, such as word processors.

Since the paper [PDF] came out, TrueCrypt released version 6.0, which addresses many of the issues presented in this paper. But the bottom line is that you shouldn’t depend on this deniability feature. It’s much safer to encrypt the entire disk, to ensure that sensitive data isn’t left on unencrypted portions of the file system. The only problem with this method is that you can’t deny having anything encrypted.

If you’ve ever wanted to see how a German Enigma machine encrypts something, this Flash demo is perfect.

Like other rotor machines, the Enigma machine is a combination of mechanical and electrical systems. The mechanical mechanism consists of a keyboard; a set of rotating disks called rotors arranged adjacently along a spindle; and a stepping mechanism to turn one or more of the rotors with each key press. The exact mechanism varies, but the most common form is for the right-hand rotor to step once with every key stroke, and occasionally the motion of neighbouring rotors is triggered. The continual movement of the rotors results in a different cryptographic transformation after each key press.

For more on Enigma’s history and mathematical foundations, check out the Wikipedia site.