Broadcast key distribution apparatus and method using Chinese Remainder
First Claim
1. An apparatus for performing network communication, said apparatus comprising:
- a plurality of receiver units individually having a prime value and a private key;
transmitter processing logic selecting a subset of said plurality of receiver units and individually encrypting a master key, K, with each private key of said subset of receiver units;
said transmitter processing logic further solving a set of relationships that contain values associated with said subset of receiver units wherein a single value, X, solves each relationship, said set of relationships including an individual prime value, an individual encrypted master key, and said single value X for each receiver unit of said subset; and
broadcast processing logic coupled to communicate with said transmitter processing logic for transmitting said single value, X, to each receiver unit of said plurality of receiver units.
1 Assignment
0 Petitions
Accused Products
Abstract
A communication system utilizing low bandwidth requirements for transmitting an encoded value formulated using the Chinese Remainder procedure to receivers having a private key. The system offers the advantages of low bandwidth transmission of single standard key systems but the security of private key systems. Each receiver contains a private key and a prime number associated with the receiver. The transmitter system utilizes the Chinese Remainder procedure and the private key and the prime number associated with each receiver to generate a unique value X that solves a particular set of relationships for a set of authorized receivers of the communication network and no others. The value X is broadcast to all receivers and each receiver utilizes its prime number and its private decryption key to arrive at a master key. Unauthorized receivers will not obtain a valid master key because their prime numbers are outside of the set relationships that X solves. By broadcasting only X, the system avoids the requirement of broadcasting a separate encoded version of the master key to each authorized receiver. The system may be used to also broadcast new private keys to the receivers or a subset of receivers within the network.
-
Citations
38 Claims
-
1. An apparatus for performing network communication, said apparatus comprising:
-
a plurality of receiver units individually having a prime value and a private key; transmitter processing logic selecting a subset of said plurality of receiver units and individually encrypting a master key, K, with each private key of said subset of receiver units; said transmitter processing logic further solving a set of relationships that contain values associated with said subset of receiver units wherein a single value, X, solves each relationship, said set of relationships including an individual prime value, an individual encrypted master key, and said single value X for each receiver unit of said subset; and broadcast processing logic coupled to communicate with said transmitter processing logic for transmitting said single value, X, to each receiver unit of said plurality of receiver units. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. An apparatus for performing network communication, said apparatus comprising:
-
a plurality of receivers individually having a prime value and a private key associated therewith; transmitter processing logic selecting a subset of receivers of said plurality of receivers and for encrypting a master key, K, individually with each private key of said subset of receivers to produce an encrypted master key, K'"'"'(i), for each receiver of said subset of receivers; wherein said transmitter processing logic is also for solving a set of relationships, in a form of;
space="preserve" listing-type="equation">K'"'"'(i)=X mod (p(i)) (i=1 to n),that are associated with said subset of receivers wherein a single value, X, solves each relationship and wherein n is the number of receivers within said subset, p(i) is said prime value for a receiver, i, and K'"'"'(i) is said encrypted master key of said receiver, i, said transmitter processing logic utilizing the Chinese Remainder procedure to solve for said value X; and broadcast processing logic coupled to communicate with said transmitter processing logic for transmitting said value, X, to each receiver of said plurality of receivers. - View Dependent Claims (9, 10, 11)
-
-
12. A computer implemented apparatus for updating private keys associated with receivers within a communication network, said apparatus comprising:
-
a plurality of receiver units individually having a prime value and a current private key; key generation logic for generating a new private key for each receiver unit of said plurality of receiver units; transmitter encryption logic for encrypting each new private key of each receiver unit with said current private key of each receiver unit to generate a set of encrypted new private keys for said plurality of receiver units; transmitter computation logic for solving a set of relationships, each relationship involving a prime value and an encrypted new private key, for each individual receiver unit within said plurality of receiver units, wherein a single value, X, solves each relationship; and broadcast processing logic coupled to communicate with said transmitter computation logic for transmitting said single value, X, to each receiver unit of said plurality of receiver units. - View Dependent Claims (13, 14, 15, 16, 17)
-
-
18. A computer implemented method for network communication comprising the computer implemented steps of:
-
providing a transmitter and a plurality of receivers, wherein each receiver has a corresponding prime value and private key; determining a subset of receivers of said plurality of receivers; generating a master key, K, and storing said master key in memory; encrypting said master key, K, with each private key of said receivers of said subset to produce a set of encrypted master keys; generating a single value, X, by solving a set of relationships, wherein each relationship includes X, an encrypted master key, and a prime value for individual receivers of said subset; and broadcasting said single value, X, from said transmitter to said plurality of receivers. - View Dependent Claims (19, 20, 21, 22, 23, 24, 25, 26)
-
-
27. A computer implemented method for broadcasting new private keys to receivers within a communication network, said method comprising the computer implemented steps of:
-
providing a transmitter and a plurality of receivers, wherein each receiver has a corresponding prime value and current private key; generating a new private key, kn(i), for each receiver of said network; encrypting each new private key, kn(i), with each current private key of each of said plurality of receivers to produce a set of encrypted new private keys; generating a single value, X, by solving a set of relationships, wherein each relationship includes X, an encrypted new private key, and a prime value for individual receivers of network; and broadcasting said single value, X, from said transmitter to said plurality of receivers of said network. - View Dependent Claims (28, 29)
-
-
30. Within a network in which receivers individually contain a prime value, p(i), and a current private key, ko(i), a computer implemented method of broadcasting new private keys to receivers of said network, said method comprising the steps of:
-
generating master key, K; generating a set of new private keys, kn(i), for a subset of said receivers; individually encrypting each new private key of said set of new private keys with each current private key of said receivers of said subset to generate a set of encrypted new private keys, k'"'"'(i); encrypting said master key, K, with each of said new private keys, kn(i), to generate a set of encrypted master keys, K'"'"'(i) for said subset; generating a single value, X, from a set of relationships in the form of
space="preserve" listing-type="equation">k'"'"'(i)=X mod (p(i)),for each receiver, i, of said subset; generating a single value Y, from a set of relationships in the form of K'"'"'(i)=X mod (p(i)), for each receiver, i, of said subset; encrypting Y using K to obtain Y'"'"'; and broadcasting X, Y and Y'"'"' to all receivers within said network. - View Dependent Claims (31, 32, 33, 34)
-
-
35. In a communication network having a transmitter and a plurality of receivers, each receiver having a private key, k(i), and a prime value, p(i), associated therewith, a method of broadcasting information therein, said method comprising the computer implemented steps of:
-
determining an arbitrary subset of receivers within said network; generating a master key, K; generating a set of encrypted master keys, K'"'"'(i), by encrypting said master key with each private key of said subset of receivers; generating a set of relationships in the form of K'"'"'(i)=X mod (p(i)) for each receiver, i, of said subset of receivers; solving said set of relationships for X; and broadcasting X over said network to said plurality of receivers of said network. - View Dependent Claims (36, 37, 38)
-
Specification