`Mason
`
`[11] Patent Number:
`[45] Date of Patent:
`
`4,736,422
`Apr. 5, 1988
`
`[75]
`
`[73] Assignee:
`
`[54] ENCRYPTED BROADCAST TELEVISION
`SYSTEM
`Inventor: Arthur G. Mason, Hampshire, United
`Kingdom
`Independent Broadcasting Authority,
`London, England
`705,422
`[21] Appl. No.:
`Jul. 2, 1984
`[22] PCT Filed:
`PCf/GB84/00237
`[86] PCTNo.:
`§ 371 Date:
`Feb. 22, 1985
`Feb. 22, 1985
`§ 102(e) Date:
`[87] PCT Pub. No.: W085/00491
`PCT Pub. Date: Jan.31, 1985
`Foreign Application Priority Data
`[30]
`Jun. 30, 1983 [GB] United Kingdom ................. 8317796
`Jul. 22, 1983 [GB] United Kingdom ................. 8319817
`[51]
`Int. Cl.4 ........................ H04N 7/167; H04L 9/02
`[52] U.S. CI •........................................ 380/20; 380/21;
`380/10
`[58] Field of Search ....................... 358/114, 122, 123;
`178/22.13, 22.08
`
`[56]
`
`References Cited
`U.S. PATENT DOCUMENTS
`4,292,650 9/1981 Hendrickson .
`4,352,0ll 9/1982 Guillou .
`4,388,643 6/1983 Aminetzah ....................... 178/22.13
`4,484,027 1l/1984 Lee eta!. ............................ 358/122
`4,531,020 7/1985 Wechse1berger et al ........... 358/123
`4,531,021 7/1985 Bluestein et al ................. 178/22.08
`4,536,791 8/1985 Campbell et al ...................... 380/10
`4,613,901 9/1986 Gilhousen eta!. ................... 380/20
`
`OTHER PUBLICATIONS
`WO, AI, 83/01881 (Communications Satellite Corpora(cid:173)
`tion), 26 May 1983; seep. 4, Line 1-p. 8, Line 7; p. 9,
`Lines 25-29.
`·
`EP, AI, 0014654 (Telediffusion de France), 20 Aug.
`1980, seep. 7, Line 11-p. 8, Line 26.
`WO, AI, 83/04154 (Telease), 24 Nov. 1983, see p. 4,
`Line 5-p. 7, Line 25.
`Primary Examiner-Stephen C. Buczinski
`Assistant Examiner-Melissa L. Koitak
`ABSTRACT
`[57]
`A conditional access system for transmitting and receiv(cid:173)
`ing scrambled television signals over-air includes means
`for addressing each of the receiving apparatus with an
`over-air signal whereby to permit reception and de(cid:173)
`scrambling of the signal. The transmitter is provided
`with means for assembling a cipher block of information
`including a first key for use in descrambling the televi(cid:173)
`sion signal and information relating to a plurality of
`users, and means for encyphering the cipher block with
`a second key which is common to the plurality of users.
`On reception a receiver applies the second, common
`keys to the received cipher block, recovers the first key
`for use in descrambling the signal and the information
`relating to the respective user and descrambles tee tele(cid:173)
`vision signal. Further, it is proposed to transmit a fur(cid:173)
`ther key in encrypted form and to use the first key to
`decrypt the further key which is then used to descram(cid:173)
`ble the television signal. This provides a three level key
`system which is very secure but by using a common
`second key for a plurality of users, the time to access
`each user is short.
`
`23 Claims, 5 Drawing Sheets
`
`TRANSMITTER
`S~)~----------------~
`P(fs+S+PJ -f·--t-\
`
`12
`
`TELEVISION
`SIGNAL
`A
`
`KEY P
`
`SHARED
`DISTRIBIJTION
`KEY D
`
`E=ENCRYPTION
`E-1=DECRYPTION
`
`16
`
`APPLE EX. 1005
`Page 1
`
`
`
`RECEIVER
`
`11
`
`10
`
`I'ftffA~SION A
`SESSION KEYS
`CHANGED
`EVERY FEW
`SECONDS
`
`TIERING LEVEL OF
`SIGNAL T5
`PERIOD KEY p
`CHANGED
`EACH PERIOD
`
`KEY P
`
`TIERING LEVEL OF
`CUSTOMER Tc r - - - - -
`
`SHARED
`DISTRIBUTION
`KEY D
`
`17
`
`KEY
`D
`
`E=ENCRYPTION
`E-1=DECRYPTION
`
`fiG./.
`
`APPLE EX. 1005
`Page 2
`
`
`
`U.S. Patent
`
`Apr. 5,1988
`
`Sheet 2 of5
`
`4,736,422
`
`~~
`s~
`fi]£9
`~~
`~C)
`
`Q
`~).....
`ffi~Cl..
`0:
`
`l:!:!~V)
`C§~c::l -
`V)
`N
`Ci3W01Sn:J
`
`f--
`
`g
`Ci3W01Sn:J
`/7
`Ci3W01Sn:J -
`£'
`Ci3W01Sn:J
`c
`Ci3W01Sn:J
`l
`Ci3W01Sn:J
`
`~
`1..:::::
`Q::
`8
`~
`tE
`~
`<::)
`t5
`§
`~
`0::
`~
`--..1
`
`r - - -
`
`Z5
`i=:
`&1
`~
`8
`~
`9::
`Lu~
`
`f.---
`
`~
`~
`tn
`~
`@
`eJ ;e
`~~
`Cs~
`
`' - - - -
`
`APPLE EX. 1005
`Page 3
`
`
`
`U.S. Patent
`
`Apr. 5,1988
`
`Sheet 3 of 5
`
`4,736,422
`
`I
`
`I
`
`I
`
`I
`
`I
`
`187 BIT PLAINTEXT BLOCK
`t
`I 64 BITE
`
`I
`I
`
`I 64 BITE
`
`I
`
`r 64BIT E
`t
`64 BITE
`t
`187 BIT INTERMEDIATE STAGE
`t
`64 BITE
`t
`f 64 BITE
`t
`I 64 BITE I
`
`Ml IV/MUM OVERLAP
`OF
`E BLOCKS
`16 BITS
`
`1st STAGE
`I
`
`M~ 'NIMUM OVERLAP
`OF
`E BLOCKS
`16 BITS
`
`I
`I 64 BITE
`t
`I
`187 BIT CIPHERTEXT BLOCK
`E=64 BIT BLOCK ENCRYPTION ALGORITHM
`
`fiG.Jo.
`
`APPLE EX. 1005
`Page 4
`
`
`
`MSB
`
`KEY
`REGISTER
`K
`64 BITS
`64 atTS--tft
`
`LSB
`
`1£64 BITS
`
`~
`rJl .
`~
`........
`SHIFT
`~
`REG!-
`STER ~
`R
`
`ONE WAY
`FUNCTION
`
`~-8
`
`l
`
`L
`8
`
`/
`
`8
`
`MS B
`
`LSB
`
`REGISTER
`A
`
`I IUER>E I
`
`DIRECTION
`EACH ROUND
`REGISTER B
`INTERMEDIATE
`STAGE
`
`MSB
`
`LSB
`
`64
`BITS
`
`'8
`
`""ENCRYPTION
`
`' ""sw
`
`DECRYPTION
`RG.Jb.
`
`>
`~
`
`._.Ul
`
`~
`~
`00
`00
`
`00. =-!'T> a
`....
`a
`
`Ul
`
`.&;it..
`,...
`~
`0'\
`,...
`.&;it..
`~
`
`APPLE EX. 1005
`Page 5
`
`
`
`U.S. Patent
`
`Apr. 5,1988
`
`Sheet 5 of5
`
`4,736,422
`
`CUSTOMERS X,Y,Z
`SHARE KEY Dold
`
`--- Dnev./Y.Z)
`
`X BECOMES A PIRATE
`AND IS EL/fv!INATED
`
`THE BROADCASTER IS
`SURE THAT Y AND Z
`HAVE RECEIVED Dnew
`BECAUSE THEY HAVE
`BOTH SENT TWO
`SUBSCRIPTIONS
`
`AG4.
`
`APPLE EX. 1005
`Page 6
`
`
`
`1
`
`4,736,422
`
`ENCRYPTED BROADCAST TELEVISION SYSTEM
`
`2
`of an embodiment thereof given by way of example, in
`which:
`FIG. 1 shows a block diagram of an encryption sys-
`tern;
`The present invention relates to the broadcasting of a
`television signal in scrambled form and more particu- 5
`FIG. 2 shows the structure of one part of one of the
`signals sent in the system shown in FIG. 1;
`larly to a system for enablirlg the scrambled television
`FIGS. 3a and 3b show diagrammatically two ways of
`signal to be descrambled by authorised viewers only.
`It has already been proposed to broadcast scrambled
`implementing a part of FIG. 2; and
`television signals. It has also been proposed to transmit
`FIG. 4 shows a method of replacing shared distribu-
`with the scrambled television signal the key for de- 10 tion keys.
`A preferred embodiment of the present invention will
`scrambling the signal but the key is encrypted by a
`further key, an identification key, which is unique to
`be described in relation to an over-air addressing DBS
`each viewer. In order to decrypt the key the viewer
`television encryption system as shown in FIG. 1. A
`subscriber cannot make use of a conditional access tele-
`must use his identification key signal and await the
`broadcast encrypted key.
`15 vision programme without being in possession of the
`This is acceptable as long as the number of viewers is
`key that was used for the signal encryption. Further-
`not considerable but where one is broadcasting to a
`more, this key must be kept secret from the customer.
`considerable number of viewers, for example with satel-
`Since the broadcast signal, in this case the satellite sig-
`lite broadcasting, it can take a considerable time to
`nal, is common to all subscribers, it follows that the key
`access all the viewers with their own encrypted key 20 which is used to cipher the television signal must also be
`common to everyone. It is generally regarded as inse-
`signal to enable them to descramble the broadcast tele-
`vision signal. While this problem can be overcome by
`cure to have the same key held in millions of receivers
`leaving the receiving apparatus powered up continu-
`for long periods of time. This is because the key might
`ously, this is not a convenient or inexpensive solution to
`be discovered by one subscriber who could then distrib-
`the problem. Furthermore, when the receiver is first 25 ute it to others customers, who would use it to obtain
`purchased a long waiting time results.
`free television programmes. The only way to avoid this
`It is an object of the present invention to provide a
`problem is to change this key, which we call the session
`key (S), at very frequent intervals. The session key (S) is
`system for sending encrypted programme entitlements
`together with a period key to one of a large number of
`also known in other references as the central word
`viewers in such a way that he can relatively qnickly 30 (CW) or the initialisation word (ij or indeed the service
`access the encrypted entitlements and period key which
`key (S). The session key interval may be of the order of
`enable him to decypher the scrambled teleivision signal.
`one to ten seconds to avoid long access times when
`The period key (P) is also known as the authorisation
`different channels are selected. Clearly the only way to
`key (A), but it will be called the period key here.
`send a new session key, that changes every few seconds,
`The present invention provides for sending to a plu- 35 is with the broadcast signal. The session key is not sent
`rality of viewers their individual programme entitle-
`with the television signal in the clear-it is encrypted
`ment and the period key, encrypted together as one
`with another key that is stored in the receiver. VIti-
`cipher text block by means of a single distribution key
`mately, there will have to be a key stored in each re-
`which is used by each viewer to obtain the necessary
`ceiver that has to be kept secret from the user. One way
`information for descrambling the television signal. 40 to achieve this secrecy is to 'bury' the key in an inte-
`Hence the distribution key and the cipher text block is
`grated circuit or some device which cannot easily be
`shared between the plurality of viewers. The sharing of
`broken open. Since it is not possible to send new secu-
`information in this way enables a reduction in the total
`rity devices to each customer at regular very short
`means of bits that have to be transmitted without com-
`intervals-it follows that the key stored in each device
`promising the security. The reduction of bits occurs 45 must be unique to each subscriber for reasons of system
`because in a shared block, only one period key needs to
`security. The customer unique key that is stored in the
`be sent and its overhead is shared. If the cipher text
`security device will be called the distribution key (D).
`block was not shared a separate period key, which
`Since there are a huge number of distribution keys,
`needs to be a large number of bits, would have to be
`using this key to distribute the session key to each cus-
`appended to each viewers entitlements for reasons of 50 tomer is impractical. This is because the time taken to
`security.
`send the session key would be much longer than the one
`The present invention also provides a secure scram-
`second duration for which the session key is valid. In
`order to overcome this problem a period key (P) is
`bling system for apparatus for transmitting a scrambled
`information signal comprising means for generating a
`. introduced. The key is available for some period ·which
`first encryption signal (S), first encryption means for 55 is defmed by the broadcaster-the period may be as
`encrypting the information signal in accordance with
`little as one hour or as much as one month. the duration
`the encrypting key signal (S), means for generating a
`of the period is a compromise between security and the
`second encryption key signal (P), second encryption
`operational difficulties in receiving the key. The period
`means for encrypting the first encryption key signal in
`key is common to all subscribers and is used to carry the
`accordance with the second encryption key signal (P), 60 session key. The period key is itself carried by the cus-
`means for generating a third encryption key (D), third
`tomer distribution keys which are stored in each re-
`encryption means for encrypting the second encryption
`ceiver.
`key signal (P) in accordance with the third encryption
`FIG. 1 shows schematically how a practical system
`key signal (D), and means for transmitting the scram-
`might be implemented. An information signal A, in this
`bled information signal and at least the encrypted sec- 65 case a television signal, is to be scrambled for transmis-
`ond encryption scrambling key signal.
`sion. Firstly a session key S is generated by suitable
`Features and advantages of the present invention will
`circuitry 10 and this keyS is used to scramble the signal
`A in accordance with the key S as represented by the
`become more apparent from the following description
`
`APPLE EX. 1005
`Page 7
`
`
`
`4,736,422
`
`3
`block 11. So that the key S can be securely sent to a
`receiver, it is also scrambled in a circuit 12 in accor(cid:173)
`dance with a further scrambling routing identified by a
`second key P generated by suitable circuitry 14. Both
`the session key S and the second key P are changed at
`intervals but the second key need be changed at less
`frequent intervals than the session key S.
`Finally, the second key P is scrambled in a circuit 16
`by a third key, the distribution key D, generated by a
`circuit 17. The scrambled information signal, the scram- 10
`bled session key and the scrambled second key are then
`transmitted using any suitable equipment.
`In a receiver, the reverse operation is carried out. It is
`first necessary for a customer to decrypt the second key
`P using his distribution key D before the session key S 15
`can be recovered for decrypting the information signal.
`Thus a first decryption circuit 20 responsive to distribu(cid:173)
`tion key D is provided for decrypting the second key P
`and a second decryption circuit 21 responsive to the
`second key P is provided for decrypting the session key 20
`S which is then used in a third decryption circuit 23 for
`decrypting the information signal A.
`Different customers may require different entitle(cid:173)
`ments to the service. Furthermore, the entitlement may
`take different forms, e.g. a simple indication of whether 25
`a basic subscription has been paid or note, or they may
`indicate an over-air credit payment or they may simply
`indicate a tier level to which the viewer subscribes. The
`entitlements are represented by a small number of bits
`which are preferably sent together with the period key 30
`(P) in a shared cipher text block. The example described
`below makes use of the entitlement bits for tiering.
`However, the mode of use of the entitlement bits does
`not affect the principle of showing a distribution key
`and an encrypted cipher text block together between a 35
`plurality of viewers.
`The tiering level of the signal (Ts) is sent with the
`session key. The tiering level requested by the customer
`(Tc) is sent to him with the period key using his distri(cid:173)
`bution key. The security device compares Ts and Tc 40
`and decides whether the session key can be released for
`the purpose of deciphering the television signal (A).
`The session key (S) is used to encipher the television
`signal. It is sent together with the tiering level of the
`programme (Ts) by encrypting these signals with the 45
`period key P(Ts+S+P). The reason for duplicating the
`period key (P) in the message, before encryption with
`the same key P, will be described later. More than one
`session key may be sent if more than one operator is
`broadcasting simultaneously on the same satellite signal. 50
`This may happen for instance if one operator provides
`the television programme and another organisation
`provides a data service. (The symbol '+' means that the
`bits of the signals are appended together.)
`The main problem with this system is the time taken 55
`to send the signal D(Tc+P) to each customer. If a
`unique key D is defined for each subscriber the cycle
`time of this validation signal, after error correction has
`been applied, can take many hours.
`We propose reducing the validation cycle time by 60
`sharing the same distribution key D between a number
`of customers. This still offers excellent system security
`since, if the number of customers sharing the same key
`is small, the probability of fmding another customer
`with the same key as ones own is tiny. For example, if 65
`20 customers share each key and there are 20 million
`subscribers in the system, the probability of finding
`another customer with the same key as ones own is
`
`4
`10-6. In fact some 1000 customers could share the same
`key with negligible effect upon the system security.
`We propose to send the period key and the entitle(cid:173)
`ment signals indicative of each of a plurality of subscrib(cid:173)
`ers in one block as shown in FIG. 2. In the numerical
`example shown below a block size of 510 bits is used.
`A BCH error correcting code is defined by the block
`to allow correct reception at a specified bit error rate.
`The BCH code requires several bits within the block to
`be used for error correction leaving the remainder for
`use as a message which contains the following informa(cid:173)
`tion:
`(i) A period key of about 56 bits. The period key bits
`could be evenly distributed throughout the message
`block. However, this is not really necessary because
`of the nature of the block encryption algorithm
`which is used.
`(ii) A byte of about 8 bits for each customer in the block.
`A number of customers have bytes in the one block.
`The following represents an example of the proposal.
`(i) no. of bits per block: N =51 0
`(ii) no. of bits for error correction: E= 136
`(iii) no. of bits for the message: M=374
`(iv) no. of bits for period key: P=56
`With this arrangement if each customer used 8 bits
`then 46 customers could each share the block. In prac(cid:173)
`tice a mode word of 6 bits and a date stamp of 24 bits is
`also included which is shared by the plurality of cus(cid:173)
`tomers. This allows 36 customers to share the block
`which gives a cycle time of 10 minutes for 15 million
`subscribers when a data rate of about 350K Bits/sec is
`used. However, the technique may be generalised to
`any number of bits.
`The block is encrypted using an algorithm which has
`the properties of error extensions. Such an algorithm
`can be constructed from a block or feedback cipher
`arrangement which has the property that if one bit of
`the cipher text is falsified the resulting plain text mes(cid:173)
`sage willloock look completely random even when the
`correct distribution key is used to decrypt the block.
`This also means that there does not exist a unique set
`of 56 bits in the ciphered message to which the distribu(cid:173)
`tion key could be applied in order to recover the period
`key. In order to fmd the period key, without knowledge
`of the distribution key, either an exhaustive search of
`the 374 bits is needed or the encryption algorithm needs
`to be broken. After deciphering the message, each secu(cid:173)
`rity device looks in the correct place within the block
`for the customer entitlement bits that are intended for
`that receiver. Clearly this function must be buried in the
`security device along with the distribution key.
`The block or feedback cipher should have the follow(cid:173)
`ing property. If one bit of the cipher text is altered, a
`number of bits of the plain text will be altered, under the
`same key, and these altered bits will be evenly distrib(cid:173)
`uted over the plain text message.
`FIG. 3a shows schematically how long blocks may
`be ciphered using a number of 64 bit sub-blocks. Each
`sub-block is a 64 bit block cipher.
`The essential features is to overlap the sub-blocks and
`form an intermediate stage. The fmal cipher text block
`is guaranteed to have the properties described above by
`reversing the direction in which the sub-blocks are over(cid:173)
`lapped during the second stage. The same technique of
`forming an intermediate stage and reversing the direc(cid:173)
`tion in which the algorithm is performed for the second
`stage can be applied to cipher feed back in order to
`achieve the necessary cipher text properties. Cipher
`
`APPLE EX. 1005
`Page 8
`
`
`
`25
`
`5
`feedback is a well known technique and the technique
`of reciphering the cipher text in the reverse direction is
`shown in FIG. 3b.
`The proposed system of sharing a distribution key
`between several subscribers suffers from the problem
`that if one customer becomes a pirate, removal of the
`key affects the other customers who also share that key.
`There are basically two methods of overcoming this
`problem which are described below.
`Instead of storing just one secret distribution key, 10
`each customer has a plurality of keys e.g. two, stored in
`his receiver. The ftrst key would be common to a ftrSt
`set of customers while the second key would be com(cid:173)
`mon to a second set of customers. One one member of
`the ftrSt set can be in the second set. Each customer is 15
`then given a unique combination of two keys from the
`total number of keys available. The total number of
`combinations far exceeds the total number of keys avail(cid:173)
`able.
`A pirate is eliminated by removing both of his keys 20
`from the cycle. Since the customers who share his two
`keys all have another but different key remaining, they
`are able to continue. This results from the fact that the
`pirate is the only customer who is a member of both
`shared key sets.
`It can be shown mathematically, that because the
`number of combinations is huge, the probability of dis(cid:173)
`abling honest customers after many pirate combinations
`have been removed is small.
`Instead of storing two distribution keys which are 30
`both shared, two keys may be stored via the receiver
`and used in the following way.
`The ftrSt key is the shared distribution key and the
`second is a unique key which is not shared and it is
`different for each customer. When a pirate is detected a 35
`new shared distribution key (DNEW) is sent to each of
`the remaining honest customers by encrypting it with
`their personal Unique key (U); see FIG. 3. Hence if X,
`Y and Z share a block which is normally encrypted
`with the shared Distribution key (DoLD) and X be- 40
`comes a pirate; customers Y and Z are send D NEW by
`transmitting Uy(DNEW) and Uz (DNEw). Clearly the
`format for the transmission of U(D) is much less efft(cid:173)
`cient than the shared distribution key cycle D(M + P)
`but this is not important because the second cycle only 45
`includes a very small number of customers. A broad(cid:173)
`caster can be sure that his customer has received this
`new shared distribution key (D) by transmitting the
`U(D) signal until his customer has returned say two
`subscription payments. Since the cycle time of the U(D) 50
`signals will be very small, probably less than one min(cid:173)
`ute, and because the customer has returned more than
`one subscription payment-the broadcaster can be con(cid:173)
`ftdent that his customer will have received the new
`shared key. This conftdence relies upon the assumption 55
`that each subscriber will be watching television for
`more than one minute during a subscription period for
`which he has paid.
`The idea of transmitting a small U(D) cycle for a long
`period of time allows the cycle time/data capacity to 60
`expand to cater for an emergency update and then con(cid:173)
`tract again afterwards. Hence the average cycle time/(cid:173)
`data capacity stays approximately constant during the
`lifetime of the system; it is illustrated in FIG. 3. In order
`to maximise the efftciency of the system the same tech- 65
`nique can be applied to reconftgure into new shared
`blocks those customers who have become the only
`members of an old shared block. This is achieved by
`
`4,736,422
`
`6
`sending new addresses to old customers using the same
`method described above.
`The information that is contained within the en(cid:173)
`crypted block not only contains the new shared distri(cid:173)
`bution key D and the new address (a), but also the U
`key. The encrypted block then takes the form U(D(cid:173)
`+a+U). The U key is sent in the encrypted block for
`the purpose of checking that the information has been
`received correctly. Provided that the secret U key is
`also found in the message after decryption, the remain(cid:173)
`der of the information is accepted.
`The above described system makes use of storing of
`the secret distribution keys in a user held security de(cid:173)
`vice. Since the copying of the contents of the security
`device is likely to represent a weak link in the system,
`re-issue of the security device from time to time might
`be required by- the broadcaster. Therefore, an alterna(cid:173)
`tive approach is to mount the security device in such a
`way that is can be re-issued periodically at little ex(cid:173)
`pense. Such a device could be a security microproces(cid:173)
`sor mount in a SMART card.
`If it is required to remove a key before the re-issue
`date, the broadcaster simply contacts the other custom(cid:173)
`ers who share that key and sends them a new SMART
`card. Since the number of customers who share the
`removed key is very small (approx. 36) this practice
`unlikely to cause much of a problem. Furthermore, the
`broadcaster might offer one month's free viewing to
`compensate for the inconvenience caused to the honest
`key holders.
`Modifications to the above described system may be
`made which will improve the practicality of the system.
`For example, the period key that is sent in the validation
`cycle may be the key for the next period. Although this
`key may be received quickly it should not be able to be
`used straight away. This would mean that a new cus(cid:173)
`tomer may have to wait for several weeks before he
`could receive television programmes. In order to over(cid:173)
`come this problem the current period key is sent en(cid:173)
`crypted with the next period key-PNEXT(PcuRRENT).
`Provided the customer is permitted to receive pro(cid:173)
`gramme during the next month, say, he may begin view(cid:173)
`ing from the time he has received his validation signal.
`A further modiftcation is to send a known code en(cid:173)
`crypted with the period key. This signal is useful for the
`purpose of deciding whether the period key has been
`received correctly and that the encrypted block has not
`been falsifted. The code could be made secret by using
`the period key for the special code. The receiver ftnds a
`binary word that it thinks is the period key by decrypt(cid:173)
`ing the signal D(T c+ P). Provided the period key P has
`been received without error, using it to decrypt the
`signal P(P) or P(Ts+S+P) will reveal the same period
`key P. this can be checked by comparing the received P
`key value with the value of the P key contained in the
`message Ts+S+P. If the comparison is negative the
`receiver makes the decision to interrogate the address
`cycle again. The check also ensures that the signal
`P(Ts+S+P) as well as the signal P(Tc+P) is a valid
`signal.
`The encryption system signals may be formatted into
`a data frame in a packet system such as is proposed for
`the sound for the European Satellite Broadcast signal
`standard. A sync word and address word are needed to
`locate the various signals. the security device uses the
`address word to ftnd the particular 510 bit block, in the
`long validation cycle, that is intended for that receiver.
`
`APPLE EX. 1005
`Page 9
`
`
`
`4,736,422
`
`7
`A method of synchronising the key changes may be
`achieved in a packet multiplexing system by having two
`signals. The first is a frame counter on line 625 which
`represents a clock. Keys arrive asynchronously and are
`changed during line 625 at specified times. A second
`signal is sent in the packet multiplex which labels the
`transmitted keys with the time that they are to be acti(cid:173)
`vated. An alternative approach, which eliminates the
`need for a time label, is to transmit the keys synchro(cid:173)
`nously with the television signal. There are two keys 10
`that need to be changed-the period key and the session
`key.
`What is claimed is:
`1. Apparatus for transmitting a scrambled informa(cid:173)
`tion signal, togther with a key required at a receiver to 15
`enable descrambling of the scrambled information sig(cid:173)
`nal to occur, to entitled receivers, comprising:
`means for scrambling an input information signal A to
`produce a scrambled information signal S(A);
`means for generating a first encryption key P re- 20
`quired at a receiver to enable descrambling of the
`scrambled information signal S(A) to occur;
`means for defining groups of entitled receivers;
`means for generating a plurality of distribution keys
`D, each distribution key being generated for a par- 25
`ticular group of entitled receivers;
`means for generating a plurality of receiver entitle(cid:173)
`ment signals T c, each receiver entitlement signal
`being representative of the level of entitlement of a
`respective receiver to descramble scrambled infor- 30
`mation signals;
`means for assemblit1g data blocks, adapted to assem(cid:173)
`ble for each group of entitled receivers a data block
`comprising the first encryption key P appended to
`the receiver entitlement signals Tcfor the receivers 35
`in the respective group, the receiver entitlement
`signal T c for a particular receiver in a group being
`included in the respective data block at a predeter(cid:173)
`mined location therein;
`first encryption means for encrypting each data block 40
`using one of the distribution keys, the first encryp(cid:173)
`tion means being adapted to encrypt a data block
`relating to a given group of entitled receivers using
`a particular distribution key to enable the receivers
`in a group to use the same particular distribution 45
`key to recover the first encryption key P; and
`means for transmitting the scrambled information
`signal S(A) and the encrypted data blocks.
`2. Apparatus according to claim 1, wherein the data
`block assembling means is adapted to assemble a data 50
`block omitting a receiver entitlement signal in respect of
`a first receiver belonging to the group to which the data
`blcok relates when said receiver is no longer entitled to
`recover the information signal A; and
`the first encryption means is adapted to encrypt data 55
`blocks relating to said group but omitting a re(cid:173)
`ceiver entitlement signal in respect of said first
`receiver using a distribution key D NEW different
`from that used to encrypt data blocks relating to
`said group but including a receiver entitlement 60
`signal in respect of said first receiver.
`3. Apparatus according to claim 2, and comprising
`means for producing a unique key U for each receiver,
`second encryption means for encrypting distribution
`keys D, one at a time, using said unique keys U, one at 65
`a time, and means for transmitting the encrypted distri(cid:173)
`bution keys U(D); wherein the second encryption
`means is arranged to encrypt a distribution key DNEwa
`
`8
`plurality of times using each of a plurality of unique
`keys U in tum, the plurality of unique keys U relating to
`entitled receivers in a group omitting a first receiver no
`longer entitled to recover the information signal A,
`when the distribution key D NEW is used by the first
`encryption means to encrypt a data block relating to
`said group but omitting a receiver entitlement signal in
`respect of said first receiver.
`4. Apparatus according to claim 1, wherein the algo(cid:173)
`rithm used in the encryption means has the property
`that if any part of the encrypted signal is altered an
`approximately random decrypted signal results when
`the encrypted signal is decrypted with the correct dis(cid:173)
`tribution key to make any of the received signals use(cid:173)
`less.
`5. Apparatus according to claim 1, further comprising
`means for generating a second encryption key S, third
`encryption means for encrypting the second encryption
`keyS using the first encryption key P, and means for
`transmitting the encrypted second encryption key P(S),
`and wherein the means for scrambling the input infor(cid:173)
`mation signal uses the second encryption key S to con(cid:173)
`trol the scrambling of the information signal.
`6. Apparatus according to claim 5, wherein the means
`for generating a second encryption key S is arranged to
`alter the second encryption key S at a first frequency
`and the means for generating a first encryption key P is
`arranged to alter the first encryption key at a second
`frequency lower than the first frequency.
`7. Apparatus according to claim 5, further comprising
`means for generating signals Ts indicative of a parame(cid:173)
`ter of the input information signal, said third encryption
`means encrypts said signals T s. either alone or ap(cid:173)
`pended to the second encryption key S, using the first
`encryption key P, and the means for transmitting the
`encrypted second encryption key S transmits the en(cid:173)
`crypted T s signals.
`8. Apparatus according to claim 6, further comprising
`means for generating signals T s indicative of a parame(cid:173)
`ter of the input information signal, said third encryption
`means encrypt