Pseudo-random law generator for spread spectrum communications - provides random binary words from transformation based on two initiating keys

摘要

The generator includes a calculator (7) carrying out a transformation (T) initiated by a key (Ko) provided by a memory (6). The transformation is applied to a binary word of n bits. After the operation, the word consists of r number bits from the network (Ri) contained in the number memory (1), and n-r bits provided by a pseudo-random law generator (2) initiated by a key (Ki) contained in a key memory (3). The key (Ko) is common to all networks, but the key (Ki) is characteristic of the network (Ri). The outputs of various generators thus comprise pseudo-random orthogonal lines formed using difficult cryptological algorithms. The system is partic. applicable to spread spectrum telecommunications. The r-bit word assumes Z to the power r values in a pseudo random time dependent law. These laws are all mutually orthogonal.