Abstract:
A cryptography method involving a keyholder having a number m≧1 of private keys Q1, Q2, . . . , Qm and respective public keys G1, G2, . . . , Gm, each pair of keys (Qi, Gi) (where i=1, . . . , m) satisfying either the relationship Gi=Qiv mod n or the relationship Gi×Qiv=1 mod n, where n is a public integer equal to the product of f (where f>1) private prime factors p1, . . . , pf, at least two of which are separate, and the exponent v is a public integer equal to a power of 2. Disclosed is what mathematical structure may be imparted to the public keys for it to be impossible to calculate said private keys from said public parameters in a reasonable time unless said prime factors are known. Devices adapted to implement the method are also disclosed.
Abstract translation:涉及一个密钥持有者的密码方法,该关键字具有私人密钥Q 1,Q 2的号码m> = 1。 。 。 ,以及相应的公共密钥G 1,G 2,...。 。 。 ,其中i = 1,...,m)的每对键(Q i,i,...,m) 关系如下:或者关系G i i i Q i i i / 其中n是等于f(其中f> 1)私人素数因子p 1的乘积的公共整数,其中n是公共整数。 。 。 ,其中至少两个是分离的,并且指数v是等于2的幂的公共整数。公开了什么数学结构可以被赋予公钥以使其成为 不可能在合理的时间内从所述公共参数计算所述私钥,除非所述素数是已知的。 还公开了适于实现该方法的设备。
Abstract:
According to the invention, the chip card issues a first certificate comprising its letter of credentials (Crc), an exponential (X), an optional message (M), these quantities being signed. The security module verifies the signature and in return issues a second certificate containing its letter of credentials (Crm), an exponential (Y), an optional message (M'), a cryptogram (C), these quantities being signed. A common secret key is constituted between the card and the security module by the exponentials and allows the card to interpret the cryptogram addressed to it and to act in accordance therewith.
Abstract:
A method for enabling a personal computer to be authenticated by a server is provided. The method comprises the step, which includes for the user in launching the execution of a log-on procedure software, introducing personal identifiers providing access to a signature private key for long-term use relative to the duration of the session. The log-on procedure software produces: identification data of the session Id, a public ephemeral module, a public exponent and at least a pair of ephemeral pubic numbers and ephemeral private numbers related by a generic equation of the type: Gi≡Qiv (mod n) or Gi·Qiv≡1 (mod n), an ephemeral certificate linking, by means of said signature private key, Id and public ephemeral module. The public ephemeral module is of reduced size relative to the signature private key.
Abstract translation:提供了一种使个人计算机能够被服务器认证的方法。 该方法包括步骤,其包括用于启动执行登录过程软件的步骤,引入提供对签名私钥的访问的个人标识符,用于相对于会话的持续时间长期使用。 登录过程软件产生:会话Id的标识数据,公共临时模块,公共指数和至少一对短暂公ic号和与以下类型的通用公式相关的短暂私人号码:G ≡≡≡≡v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v v SUP>≡1(mod n),通过所述签名私钥,Id和公共临时模块链接的短暂证书。 公共临时模块相对于签名私钥的尺寸减小。
Abstract:
A process for broadcasting conditional access programs which permits a progressive access. Scrambled program data is transmitted along with partial access checking messages and complete access checking messages such that subscribers having a partial access right may descramble portions of the scrambled data corresponding to information regarding only the identity of the conditional access programs, and subscribers having a complete access right may descramble the remainder of the scrambled data and view the conditional access programs. The conditional access programs may be television pictures, radio programs, or data broadcasts.
Abstract:
According to the invention, the control messages are constituted by a general addressing message (GCM), followed by shared addressing messages (SACM). The message (GCM) contains all the information common to all the user groups and a confirmation data item of the group of users and the messages (SACM) a shared address. Thus, the group is defined in a manner inherent in the control messages and can undergo reconfiguration at any time.Application to more particularly satellite broadcasting of television programmes.
Abstract:
A cryptography method involving a keyholder having a number m≧1 of private keys Q1, Q2, . . . , Qm and respective public keys G1, G2, . . . , Gm, each pair of keys (Qi, Gi) (where i=1, . . . , m) satisfying either the relationship G1=Qiv mod n or the relationship Gi×Qiv=1 mod n, where n is a public integer equal to the product of f (where f>1) private prime factors p1, . . . , pf, at least two of which are separate, and the exponent v is a public integer equal to a power of 2. Disclosed is what mathematical structure may be imparted to the public keys for it to be impossible to calculate said private keys from said public parameters in a reasonable time unless said prime factors are known. Devices adapted to implement the method are also disclosed.
Abstract:
Proof is established by means of the following parameters: m pairs of private values Q1 and public values G1 m>1, a public module n made of the product of f first factors pj, f>2, a public exponent v, linked to each other by relations of the type: G1.Qiv=1 mod n or G1=Q1v mod n. Said exponent v is such that v=2k where k>1 is a security parameter. Public value G1 is the square g12 of a base number gi that is lower than f first factors pj, so that the two equations: x2=gi mod n and x2=−g1 mod n do not have a solution in x in the ring of the modulo n integers and such that the equation xv=g12 mod n has solutions in x in the ring of the modulus n integers.
Abstract translation:证明通过以下参数建立:m对私有值Q 1>和公共值G 1> 1,公共模块n由f的乘积构成 第一个因素是,通过以下类型的关系彼此链接的公共指数v:f& v 1 = 1 mod n或者G 1 = Q 1 / 所述指数v使得其中k> 1是安全参数,其中v = 2K。 公开值G 1 SUB>是小于f first的基数g i i i i的平方根1 SUB> 2 SUP> 因子p SUB>,使得两个等式:x2 = g i mod n和x 2 = - g 1 > mod n在模n整数的环中的x中没有解,并且使得等式x SUP> = g <1> mod n在x整数的环中具有x的解。
Abstract:
The invention concerns a method whereby the proof is established by: m(≧1) pairs of private Qi and public Gi=gi2 values; a public module n formed by the product of f(≧2) prime factors; an exponent v=2k(k>1), linked by the relationships of the type: Gi−Qiv≡1. mod n or Gi≡Qiv mod n. Among the m numbers obtained by increasing Qi or its inverse modulo n to modulo n square, k−1 times rank, at least one of them is different from ±gi. Among the 2m equations: x2≡gi mod n, x2≡−gi mod n, at least one of them has solutions in x in the ring of modulo n integers.
Abstract translation:本发明涉及一种通过以下方法建立证明的方法:m(> = 1)私人Q对和/ > 2 SUP>值; 由f(> = 2)因子的乘积形成的公共模块n; 指数v = 2(k> 1),其通过以下类型的关系链接:G i> SUP>≡1。 模块或模块模块n。 在通过将Q i i i i或其反模n到模n正方数获得的m个数中,k-1次是秩,其中至少一个与±g < 。 在2m方程式中,x 2 mod n,x 2,...,n mod n, 它们中的至少一个在模n整数的环中具有x的解。
Abstract:
Process for the broadcasting of programmes with progressive conditional access and separation of the information flow, as well as the corresponding receiver, In order to form the elementary flow, groups of m successive elements of the multiplex are taken and for forming the complimentary flow groups of p successive elements of the multiplex are taken. Application to television with entitlement checking.
Abstract:
A receiver having an interface arrangement for connection between a television circuit and a conditional access sub-system conveys data via a bus having a four frame bus cycle period with a bit rate corresponding to the line rate. During a first part of the bus cycle period data is conveyed from the receiver to the sub-system sequentially as follows:i. an address block of 1 byte with the unique address of the sub-system with which the receiver is in communication,ii. a status block of 1 byte providing status information for the following blocks in the first part,iii,iv,v. three data blocks each of 93 bytes and each containing an entitlement message,vi. a keying block of 1 byte conveying keyboard or remote control commands, andvii,viii. a further block of either 1/2 byte (vii) or 21/2 bytes (vii+viii) conveying frame count information.During the second and remaining part of the bus cycle period which comprises 30 or 28 bytes, depending on the length of the further block, data is transmitted from the sub-system to the receiver.