30.11.2012 Views

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

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

great deal of data <strong>and</strong> many pages of analysis, but that was <strong>the</strong> problem<br />

faced daily by <strong>the</strong> cryptanalysts. The method can, however, be illustrated<br />

using <strong>the</strong> data from <strong>the</strong> 12-point mini-<strong>Enigma</strong> example above. We<br />

assume that <strong>the</strong> plugboard is known <strong>and</strong> that we have to see if any of <strong>the</strong><br />

known wheels at one of 12 possible starting positions could be R1. Since<br />

<strong>the</strong>re are many incorrect possibilities only two cases will be examined:<br />

one incorrect <strong>and</strong> <strong>the</strong> o<strong>the</strong>r correct.<br />

Example 9.3<br />

The doublets in <strong>the</strong> 12-point mini-<strong>Enigma</strong> above are believed to have<br />

been enciphered at consecutive wheel positions on a common groundsetting<br />

with R1 having <strong>the</strong> encipherment table shown in Table 9.2.<br />

Table 9.2<br />

Setting<br />

Input letter 1 2 3 4 5 6 7 8 9 10 11 12<br />

A K A G L H F I C F D L E<br />

B F L B H A I G J D G E A<br />

C B G A C I B J H K E H F<br />

D G C H B D J C K I L F I<br />

E J H D I C E K D L J A G<br />

F H K I E J D F L E A K B<br />

G C I L J F K E G A F B L<br />

H A D J A K G L F H B G C<br />

I D B E K B L H A G I C H<br />

J I E C F L C A I B H J D<br />

K E J F D G A D B J C I K<br />

L L F K G E H B E C K D J<br />

Show that aligning <strong>the</strong> chains as<br />

D AICJK<br />

H BLFGE<br />

The <strong>Enigma</strong> cipher machine 129<br />

(1) leads to contradictions if we assume that R1 is originally at Setting 1,<br />

but<br />

(2) produces a solution if we take R1 to be originally at Setting 2.<br />

Solution<br />

(1) We begin by enciphering vertical pairs from <strong>the</strong> chain at Setting 1 <strong>and</strong><br />

diagonal (NW–SE) pairs at Setting 2. The 12 pairs that we obtain should<br />

be consistent <strong>and</strong> provide <strong>the</strong> 6 pairs of <strong>the</strong> composite reflector: Table<br />

9.3.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!