Code and ciphers: Julius Caesar, the Enigma and the internet
Code and ciphers: Julius Caesar, the Enigma and the internet
Code and ciphers: Julius Caesar, the Enigma and the internet
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
<strong>the</strong> message were known to relate to a vital matter of national security. It<br />
has also been suggested that perhaps <strong>the</strong>re is a secret ‘trapdoor’, or<br />
Achilles heel, known to <strong>the</strong> designers of <strong>the</strong> DES that would enable those<br />
who know it to find <strong>the</strong> key in a realistic time. This could be true, but<br />
nobody has found any evidence that such a thing exists.<br />
It has also been suggested that <strong>the</strong> DES should have been based upon a<br />
longer key, 128 bits being <strong>the</strong> most popular choice. This would certainly<br />
put its security beyond question <strong>and</strong>, since <strong>the</strong>n, 128-bit encipherment<br />
has been introduced in o<strong>the</strong>r systems, but in 1977 it was not thought to be<br />
necessary.<br />
An alternative to using 128-bit keys would seem to be using two 64-bit<br />
keys in succession, but this can be shown to be only twice as secure as<br />
using a single 64-bit key provided that a vast amount of computer<br />
memory is available. The attack assumes that a known plaintext <strong>and</strong> its<br />
cipher equivalent are available. The known plaintext is enciphered under<br />
all possible 64-bit keys <strong>and</strong> <strong>the</strong> known cipher text is independently deciphered<br />
under all possible 64-bit keys. The two sets of data are sorted <strong>and</strong><br />
compared. This means that 2 57 tests are required ra<strong>the</strong>r than 2 112 . When<br />
two identical texts are found we have c<strong>and</strong>idates for <strong>the</strong> two unknown<br />
keys. Many false key pairs (about 2 48 in fact; see M27) will be found <strong>and</strong><br />
will have to be tested on fur<strong>the</strong>r known plaintext–cipher text pairs. This<br />
‘meet-in-<strong>the</strong>-middle’ attack is not practical at present <strong>and</strong> is unlikely to<br />
be so in <strong>the</strong> foreseeable future.<br />
The security of <strong>the</strong> DES is enormously increased however if we use<br />
triple encipherment. Only two keys are required but <strong>the</strong>y are employed as<br />
follows:<br />
(1) encipher with key 1;<br />
(2) decipher with key 2;<br />
(3) encipher with key 1.<br />
Encipherment <strong>and</strong> <strong>the</strong> <strong>internet</strong> 185<br />
The adversary now will have to try 2 112 possible pairs of keys <strong>and</strong> this is<br />
considered to be impossible in any realistic time. This triple DES encipherment<br />
is regarded as secure <strong>and</strong> is currently in use. This form of triple encipherment<br />
has <strong>the</strong> additional advantage that it becomes identical to single<br />
encipherment DES if <strong>the</strong> two keys are <strong>the</strong> same, for it would allow a user<br />
with triple encipherment to communicate with a single encipherment<br />
user, <strong>and</strong> vice versa. Ano<strong>the</strong>r form of triple encipherment uses three different<br />
keys in <strong>the</strong> three stages above. Once again compatibility with <strong>the</strong><br />
o<strong>the</strong>r forms is achieved by making two or more of <strong>the</strong> keys <strong>the</strong> same.