[JoGu]

Cryptology

Key Generators with Long Periods

a7Hzq .#5r<
kÜ\as TâÆK$
ûj(Ö2 ñw%h:
Úk{4R f~`z8
¤˜Æ+Ô „&¢Dø

Periods

We generate long periods by superposing some different short periods. These could by realized by gear wheels with appropriate numbers of teeth.

Assume q wheels that have ni different positions resp. Each wheel moves by one position for each encryption step. If we describe the state of the complete system by the q-tuple of positions, then the period of the state changes of this system is the least common multiple of the single periods. For an optimal effect one usually makes the single periods pairwise coprime.

The first reported occurrence of this idea is ascribed to VERNAM's colleague MOREHOUSE. VERNAM originally used as key a punch tape glued together to an endless loop. MOREHOUSE suggested the combination of several such tapes.

The combination of several gear wheels is ascribed to Parker HITT (1877–1971, US Army cryptologist in World War I), who apparently also was the first to formulate the insight:

»No message is safe in cipher ... unless the key phrase is comparable in length with the message itself.«

Examples

Historical examples used the periods

This is an early application of prime numbers in cryptology.


Author: Klaus Pommerening, 1999-Dec-03; last chnge: 2013-Nov-02.