US 4,771,459 AGrant

System for Storing and Distributing Keys for Cryptographically Protected Communication

Issue Date:1988-09-13

•2 Claims

•2 Drawing Sheets

Abstract

In a system for storing and distributing keys for cryptographically protected communication each terminal (T.sub.i) must be provided with keys. If the system comprises many terminals (T.sub.i) each terminal must have a large memory capacity therefor. According to the invention, the terminals are combined in groups (A.sub.1, A.sub.2) optionally groups of such groups (B.sub.1) being formed. By assigning, in each group, keys (g, s) to the terminals belonging to the grop (G, S) the quantity of keys to be stored in each terminal can be significantly reduced.

Metadata

Assignee

U.S. Philips Corp.

Inventor

Cornelis J. A. Jansen

Application Information

Application Number:US 8496064

Filing Date:1986-04-08

Priority Date:1985-04-29

Art Unit:222

Classifications

IPC:

H04L 904

Field of Search:

17845517937537038022.09;22.11;22.10;22.14261.5 R2.160;93;9423-25;28;21;30

Patent Drawings (2 sheets)

Description

Background of the Invention

The invention relates to a system for storing and distributing keys for cryptographically protected communication, the system comprising a plurality of terminals which are interconnectable, each terminal comprising a transmitter, a receiver, an enciphering and a deciphering arrangement and a memory arrangement storing the keys for enciphering the clear data to be transmitted by the terminal and deciphering the enciphered data to be received by the terminal.

Such a system is generally known.

In a network having N terminals there are (.sub.2.sup.N)=1/2 N (N-1) possible communication links between two terminals if it is assumed that the communication direction is not of significance. By storing in each terminal (N-1) keys a connection can be established to any other terminal, which connection is protected by a unique key. The key material for the overall network of N terminals can be represented as a N.N key matrix. A key matrix is a square matrix each element of which represents an enciphering or a deciphering key. The matrix has no elements on the main diagonal (communication of the terminal with itself is non-existent) and is symmetrical (the same key is used for communication between terminal i and terminal j and for the communication between j and i). By storing in each terminal the (N-1) keys shown in the relevant column (or the row) of the key matrix, each terminal (for example T.sub.i) can safely communicate with any other terminal (for example T.sub.j) via their common key (terminal T.sub.i utilizes key k.sub.ij and terminal T.sub. j utilizes key k.sub.ji, which keys are identical since the key matrix is symmetrical). This method, although simple, is not attractive if the number of terminals in the network is large, as the required storage capacity S in each terminal for storing the (N-1) keys amounts to (N-1).L bits, L being the length of the keys in bits. If N has a value of 10 000 and the key length L is 150 bits, then each terminal must have a storage capacity S of 1.5 Mbits.

Summary of the Invention

The invention has for its object to provide a system of the type defined in the opening paragraph, in which terminals having a limited storage capacity for storing enciphering and deciphering keys are sufficient. To accomplish this, according to the invention the system described in the opening paragraph is characterized in that the terminals are classified in a hierarchy of groups, this hierarchy having 1 levels (1.gtoreq.2), that the first, highest level (1=1) is formed by upper groups of n.sub.1=1 terminals each, that a unique upper group key matrix is associated with each upper group and that in the memory arrangement of the i.sup.th terminal (i=1, 2, . . . n.sub.1) of an upper group the i.sup.th column and the i.sup.th row of the upper group key matrix are stored, that the lowest level (1=1.sub.max) is formed by a plurality of sub-groups each having n.sub.1 terminals, that a unique lower group key matrix is associated with each lower group and that the j.sup.th row and the j.sup. th column of the relevant lower group key matrix are stored in the storage arrangement of the j.sup.th terminal (j=1, 2, . . . n.sub.l.sub.max), that--if l>2 --one or a plurality of intermediate levels are arranged between said highest and lowest levels, the intermediate levels each comprising a plurality of intermediate groups each having n.sub.l terminals, the intermediate groups having been obtained by dividing the groups present in the next higher level, that a unique intermediate group key matrix is associated with each intermediate group and that in the memory arrangement of the k.sup.th terminal of each intermediate group the k.sup.th column and the k.sup.th row of the relevant intermediate group key matrix are stored, that each terminal includes means for determining a conversation key for secret communication with any other terminal of the rows and columns of key elements stored in the memory arrangement of the terminal, this conversation key being formed from the key elements both terminals have in common and the conversation key containing a key element from the key matrix of each level.

The system according to the invention has the advantage that the required storage capacity can be reduced in a terminal depending on the number of (intermediate) levels, by a factor of 10 to 100 in those cases in which the number of terminals belonging to the network is large (for example more than 1000).

It is advantageous if the number of upper groups amounts to 2, the number of terminals per sub-group also amounts to 2 and that if l>2, the number of intermediate groups associated with the intermediate group next higher in hierarchy also amounts to 2. In this case the number of keys to be stored must be at a minimum.

Brief Description of the Drawing

An embodiment of the invention will now be described in greater detail by way of example with reference to the accompanying drawings.

FIG. 1 is a schematic representation of a prior art crypto-communication system;

FIG. 2 is a schematic representation of a first crypto-communication system embodying the invention;

FIG. 3 is an alternative representation of the system of FIG. 2; and

FIG. 4 is a schematic illustration of a second crypto-communication system embodying the invention.

Detailed Description of the Invention

FIG. 1a shows a prior art communication system which, by way of example, is formed by four terminals A, B, C and D. Each terminal is connectable to any of the other terminals. The key matrix associated with this network is illustrated in FIG. 1b and comprises a square symmetrical 4.times.4 matrix formed from the elements k.sub.ij, wherein i=a, b, c, d and j=a, b, c, d. The main diagonal of the matrix is stored as a result of which terminal B, for example, can utilize the column of key elements k.sub.ab, k.sub.bc, k.sub.bd. The key matrix has a total of 6 different keys and each terminal contains 3 different keys from this total number of keys. If terminals B and C want to communicate they inform each other thereof. Thereafter terminal B selects from the key material it has at its disposal the (sole) key it has in common with terminal C, i.e. k.sub.bc. Terminal C does the same and automatically selects the same key as terminal B. Although this system is cryptographically safe (even if all the keys of terminal A and/or D are known to an unauthorized communication participant, the latter is not capable of overhearing the connection BC), the required key storage capacity of each terminal memory is rather high, as in a system consisting of N terminals (.sub.2.sup.N)=1/2 N (N-1) connection possibilities can be distinguished and for each terminal (N-1) different keys of the total of 1/2 N(N-1) different keys must be stored. If N is large, for example 10,000, then this requires a memory storage capacity in each terminal of 1.5 Mbits if a key contains 150 bits.

The system according to the invention has for its object to reduce the required storage capacity. FIG. 2 shows such a system. The system comprises groups of terminals G.sub.1, G.sub.2, G.sub.3 and G.sub.4, each group containing a plurality of terminals. Group G.sub.3, for example, includes terminals S.sub.1, S.sub.2, S.sub.3 and S.sub.4, which terminals are interconnectable. The groups G.sub.1, G.sub.2, G.sub.3 and G.sub.4 are also interconnectable. It is proposed to arrange the system so that there is an association both between terminals within a group having a certain key matrix (the S matrix in FIG. 2b) and also between the groups themselves (the G-matrix in FIG. 2b). The sizes of the S and G matrices are determined by the number of terminals per group or the number of groups in the system, as the case may be. Although in FIG. 2 a size of 4 has been chosen for both matrices, this is in no way essential to the invention. The network may be divided into any number of groups and each group may comprise any number of terminals. There is no requirement that the number of groups be equal to the number of terminals per group.

The method of effecting a protected connection will now be described partly with reference to FIG. 3. To that end, FIG. 3a illustrates the drawing of FIG. 2a in a different way, showing the hierarchy between terminals and group. At the highest level (l=1) the groups G.sub.1. . . G.sub.4 are shown. Each group "heads" four terminals, for example T.sub.1, T.sub.2, T.sub.3 and T.sub.4 which are arranged at a second level (l=2). In each terminal the following key material is stored:

(a) the row and the column of the key matrix G of the group to which the terminal belongs. So, for example, all the terminals in group G2 are provided with keys g.sub.12, g.sub.22, g.sub.32, g.sub.42, g.sub.21, g.sub.23 and g.sub.24.

(b) the row and the column of the key matrix S associated with the terminal. So, for example, T.sub.7 (FIG. 3a) of group G.sub.2 comprises in addition to the keys obtained because of (a) the keys s.sub.13, s.sub.23, s.sub.33, s.sub.43, s.sub.31, s.sub.32 and s.sub.34.

To protect the path between, for example, terminals T.sub.1 and T.sub.14 these terminals utilize a combination of the keys which they have in common in both the S and the G matrices, i.e. as can be seen from FIG. 2b, s.sub.12, g.sub.14. This combination may, for example, be what is commonly referred to as "oneway function". Such a function has the property that it is easy to determine the function k in accordance with k=r (S.sub.1, S.sub.2. . . S.sub.p) but that it is very difficult (substantially impossible) to determine the elements S.sub.1, S.sub.2. . . S.sub.p from k. This example, and a few further examples, are illustrated in FIG. 3b.

If the required storage capacity is compared, then it is found that in the example of FIGS. 2/3 in which only 16 terminals are included in a network, the reduction in memory storage capacity is extremely marginal: in the prior art system (FIG. 1) N-1=15 keys should be stored, whilst in the system according to the invention (FIGS. 2/3) 2(2n-1)=14 keys must be stored. The advantage of the invention, however, becomes obvious if the number of terminals exceeds 1000. If N=10 000, then in the first case 9999 keys must be stored and in the second case only 398, i.e. a factor of 25 less.

The required storage capacity can further be reduced by increasing the number of levels (1). In FIG. 4 a network formed by 16 terminals is hierarchically divided into 4 levels. Each sub-group D at level l=1 contains two intermediate groups namely C.sub.1 and C.sub.2 at level l=2, whilst each intermediate group C.sub.1, C.sub.2 contains two further intermediate groups namely B.sub.1 and B.sub.2. Finally, the intermediate groups B.sub.1, B.sub.2 each contain two sub-groups, namely A.sub.1 and A.sub.2. In each terminal a row and a column of the key matrix of each of the (four) levels must now be stored. Since a 2.times.2 matrix is associated with each level, the number of keys to be stored is 4.3=12 keys instead of 15 and 14, respectively in the system of FIG. 1 and FIGS. 2/3. For large numbers the advantage is again more obvious: in the case in which N=10,000, only 76 keys must be stored for each terminal.

Generally it holds that for a prior art network having N terminals the required key storage capacity S can be determined from

if no hierarchy is used, as in the system described with reference to FIG. 1, and in that case the total of the number of different keys is

In the system according to the invention, for the case in which the network is divided into 1 levels (l>2), N.sub.i sub-groups being present at level i, a total of ##EQU1## different keys must be stored for each terminal The network has at its disposal a total of different keys. It has been found that S.sub.1 is a minimum when the number of terminals for each group and the number of subgroups per group are each chosen equal to 2. So in that case it holds that

the number of keys to be stored for each terminal amounts to

and the total number of different keys amounts to:

In Table I the above formulae are elaborated for a network having N=4096 terminals. The first line in the Table relates to the prior art system; the second and further lines relate to the system according to the invention. The last line thereof indicates the hierarchic division for the case in which the minimum number of keys per terminal (36) is desired.

Claims

What is claimed is:

1. A system for storing and distributing keys for cryptographically protected communication, the system comprising: a plurality of terminals which are interconnectable, each terminal comprising a transmitter, a receiver, an enciphering and a deciphering arrangement and a memory arrangement storing the keys for enciphering the clear data to be transmitted by the terminal and deciphering of the enciphered data to be received by the terminal, characterized in that the terminals are classified in a hierarchy of groups, this hierarchy having l levels (l >2) that the first, highest level (l=1) is formed by upper groups of n.sub.l =1 terminals each, that a unique upper.group key matrix is associated with each upper group and that in the memory arrangement of the i.sup.th terminal (i=1, 2, . . . n.sub.l) of an upper group the i.sup.th column and the i.sup.th row of the upper group key matrix are stored, that the lowest level (l=1.sub.max) is formed by a plurality of sub-groups each having n.sub.1 terminals, that a unique lower group key matrix is associated with each lower group and that the j.sup.th row and the j.sup.th column of the relevant sub-group key matrix is stored in the memory arrangement of the j.sup.th terminal (j=1, 2, . . . n.sub.lmax) that if l>2 one or a plurality of intermediate levels are arranged between said highest and lowest levels, the intermediate levels each comprising a plurality of intermediate groups each having n.sub.1 terminals, the intermediate groups having been obtained by dividing the groups present in the next higher level, that a unique intermediate group key matrix is associated with each intermediate group and that in the memory arrangement of the k.sup.th terminal of each intermediate group the k.sup.th column and the k.sup.th row of the relevant intermediate group key matrix are stored, that each terminal includes means for determining a conversation key for secret communication with any other terminal of the row and column key elements stored in the memory arrangement of the terminal, this conversation key being formed from the key elements the two terminals have in common and the conversation key containing a key element from the key matrix of each level.

2. A system for storing and distributing keys as claimed in claim 1, characterized in that the number of upper groups amounts to 2, the number of terminals of each sub-group also amounts to 2 and that if l>2, the number of intermediate groups associated with the intermediate groups next higher in hierarchy also amounts to 2.

Patent Citations (11)

Patent	Date	Inventor
US4182933	1980-01-01	Rosenblum
US4386233	1983-05-01	Smid et al.
US4386234	1983-05-01	Ehrsam et al.
US4399531	1983-08-01	Grande et al.
US4411017	1983-10-01	Talbot
US4414661	1983-11-01	Karlstrom
US4531020	1985-07-01	Wechselberger et al.
US4531021	1985-07-01	Bluestein et al.
US4549308	1985-10-01	Lo Pinto
US4578531	1986-03-01	Everhart et al.
US4607137	1986-08-01	Jansen et al.