System for storing and distributing keys for cryptographically protected communication

• US 4,771,459 A
• Filed: 04/08/1986
• Issued: 09/13/1988
• Est. Priority Date: 04/29/1985
• Status: Expired due to Fees

• Current Assignee: US Philips Corporation (Koninklijke Philips N.V.)
• Original Assignee: US Philips Corporation (Koninklijke Philips N.V.)
• Inventors: Jansen, Cornelis J. A.
• Primary Examiner(s): CANGIALOSI, SALVATORE A
• Application Number:
  US06/849,606
• Time in Patent Office: 889 Days
• Field of Search: 178/22.09, 178/22.11, 178/22.10, 178/22.14, 455/26, 179/1.5 R, 375/2.1, 370/60, 370/93, 370/94, 380/23-25, 380/28, 380/21, 380/30
• US Class Current: 380/277
• CPC Class Codes: H04L 9/0836 using tree structure or hierarchical structure
• CPC Class Codes: H04L 9/0894 Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage

Abstract

In a system for storing and distributing keys for cryptographically protected communication each terminal (T_i) must be provided with keys. If the system comprises many terminals (T_i) each terminal must have a large memory capacity therefor. According to the invention, the terminals are combined in groups (A₁, A₂) optionally groups of such groups (B₁) 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.

Claims

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_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^th terminal (i=1, 2, . . . n_l) of an upper group the i^th column and the i^th row of the upper group key matrix are stored, that the lowest level (l=1_max) is formed by a plurality of sub-groups each having n₁ terminals, that a unique lower group key matrix is associated with each lower group and that the j^th row and the j^th column of the relevant sub-group key matrix is stored in the memory arrangement of the j^th terminal (j=1, 2, . . . n_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₁ 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^th terminal of each intermediate group the k^th column and the k^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.