Multiple-destinational cryptosystem for broadcast networks

• US 4,365,110 A
• Filed: 06/05/1979
• Issued: 12/21/1982
• Est. Priority Date: 06/05/1979
• Status: Expired due to Term

• Current Assignee: COMSAT Corporation (Reorganized ISA SA)
• Original Assignee: Communications Satellite Corporation (Reorganized ISA SA)
• Inventors: Lee, Lin-Nan, Lu, Shyue-Ching
• Primary Examiner(s): Cangialosi, Sal
• Application Number:
  US06/045,703
• Time in Patent Office: 1,295 Days
• Field of Search: 370/18, 370/19, 370/21, 370/22, 370/112, 370/113, 178/22, 178/22.07, 178/22.10, 178/22.11, 375/2, 375/2.1
• US Class Current: 380/28
• CPC Class Codes: H04L 2209/601 Broadcast encryption
• CPC Class Codes: H04L 9/08 Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords network architectures or network communication protocols for supporting key management in a packet data network H04L63/06

Abstract

A method of protecting communications through encryption is disclosed which is particularly useful for multiplexed communications. On the transmit side, each message is multiplied by an enciphering key corresponding to its destination, and the products are all added together to form a cryptogram. Each receiving station divides the entire cryptogram by its own deciphering key to obtain the message intended for that station.

Claims

1. A method of sending a plurality of messages in the form of a single tranmission signal through a single transmitting station to a plurality of destinations through at least one receiving station comprising;

multiplying each of said messages by an enciphering key corresponding to its intended destination;

combining the products of said multiplication step into a cryptogram comprising said single transmission signal,

said cryptogram being defined by

space="preserve" listing-type="equation">x=[Σ

m.sub.i c.sub.i ] mod P,

where P is the product of a plurality of prime numbers p_i, c_i are the enciphering keys corresponding to respective destinations and are defined by c_i =d_i (d_i^-1 mod p_i), d_i is defined by P/p_i, m_i are numbers representing said plurality of messages, 0<

m_i <

p_i and 1≦

i≦

n;

transmitting said cryptogram to said at least one receiving station; and

dividing the received cryptogram by divisors corresponding to respective destinations to thereby recover the messages intended for each of said destinations.

2. The method according to claim 1, wherein each message m_i is given by x mod p_i, so that the messages intended for each of said destinations will be given by the remainder of the division of said cryptogram by each of said corresponding deciphering keys.

3. The method according to claim 1 wherein said plurality of messages originate from a plurality of sources so that each source-destination pair is assigned an enciphering key and a corresponding deciphering key, further comprising:

assigning to at least one of said source-destination pairs an additional enciphering and corresponding deciphering key;

alternately multiplying the messages from the source in said at least one source-destination pair by two different enciphering keys; and

dividing the received cryptogram by two different deciphering keys in order to recover the messages intended for the destination in said at least one source-destination pair.

4. In a communications system of the type in which plural messages are sent in the form of a single transmission signal from a single transmitting station to a plurality of destinations through at least one receiving station, the improvement comprising:

a plurality of multipliers for multiplying each of said messages by an enciphering key corresponding to its intended destination;

adding means for combining the outputs from said multipliers to form a cryptogram containing each of said messages and comprising said single transmission signal; and

dividing means for dividing said cryptogram by deciphering keys corresponding to said plurality of destinations to thereby derive from said cryptogram the messages intended for each destination;

the improvement comprising;

a cryptogram defined by

space="preserve" listing-type="equation">x=[Σ

m.sub.i c.sub.i ]mod P,

where P is the product of a plurality of prime numbers p_i, c_i are the enciphering keys corresponding to respective destinations and are defined by c_i =d_i (d_i^-1 mod p_i), d_i is defined by P/p_i, m_i are numbers representing said plurality of messages, 0<

m_i <

P_i and 1≦

i≦

n.

5. The system according to claim 4, wherein the message m_i intended for each destination is given by x mod p_i.

6. The system according to claim 4, wherein the messages originate at a plurality of sources and the multipliers are located at the sources to provide a degree of communication security between the sources and the said single transmitting station.

7. The system according to claim 6 wherein the number of multipliers corresponds to the number of source-destination pairs handled by said transmitting station.

8. The system according to claim 4, wherein said adding means is a mod P adder.

9. The system according to claim 4, wherein said multipliers are mod P multipliers.