22.01.2015 Views

Military Communications and Information Technology: A Trusted ...

Military Communications and Information Technology: A Trusted ...

Military Communications and Information Technology: A Trusted ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

486 <strong>Military</strong> <strong>Communications</strong> <strong>and</strong> <strong>Information</strong> <strong>Technology</strong>...<br />

generation of binary r<strong>and</strong>om sequences with the potential bit rate 100 Mbit/s<br />

eliminates the restriction connected with availability of very long one-time keys<br />

for the perfect ciphering. Unfortunately, other than the trusted couriering key<br />

distribution system still requires an effective <strong>and</strong> reasonably priced solution.<br />

II. Vernam cipher or One-Time Pad<br />

The one-time pad (OTP), also called Vernam-cipher or the perfect cipher,<br />

is a crypto algorithm where plaintext is combined with a r<strong>and</strong>om key. The one-time<br />

pad was developed in 1917 by Gilbert Vernam for the use in telex machines. Each<br />

transmitted 5-bit Baudot code was mixed with a r<strong>and</strong>om 5-bit code on a paper<br />

tape. Such tapes contained a large number of these r<strong>and</strong>om 5-bit codes <strong>and</strong> were<br />

called one-time-tape. The one-time tape ran synchronously on both the sender’s<br />

<strong>and</strong> the receiver’s telex. Vernam’s invention was the basis for several pencil-<strong>and</strong>paper<br />

versions. The name one-time pad refers to the notepads on which the keys are<br />

printed as shown in Fig. 1. In general, these pads are small booklets or microfilms<br />

with groups of five numbers or letters.<br />

Figure 1. Example of one time keys in a paper form <br />

A. One-Time Pad in practice<br />

We can only talk about OTP if four important rules are followed. When rules<br />

are applied correctly, the one-time pad can be prove unbreakable (see Claude Shannon’s<br />

“Communication Theory of Secrecy Systems”). However, if only one of these<br />

rules is disregarded, the cipher is no longer unbreakable.<br />

1. The key is as long as the plaintext.<br />

2. The key is truly r<strong>and</strong>om (not generated by simple computer Rnd functions<br />

or whatever!).

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

Saved successfully!

Ooh no, something went wrong!