公开(公告)号：US20070121936A1

公开(公告)日：2007-05-31

申请号：US10587460

申请日：2005-01-24

Applicant: Louis Guillou ,  Jean-Jacques Quisquater

Inventor： Louis Guillou ,  Jean-Jacques Quisquater

IPC: H04L9/30

CPC classification number: H04L9/3213 ,  H04L9/3033 ,  H04L9/3218 ,  H04L9/3271

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的幂的公共整数。公开了什么数学结构可以被赋予公钥以使其成为 不可能在合理的时间内从所述公共参数计算所述私钥，除非所述素数是已知的。 还公开了适于实现该方法的设备。

公开(公告)号：US5218637A

公开(公告)日：1993-06-08

申请号：US714120

申请日：1991-06-11

Applicant: Didier Angebaud ,  Jean-Luc Giachetti ,  Louis Guillou ,  Jean-Jacques Quisquater

Inventor： Didier Angebaud ,  Jean-Luc Giachetti ,  Louis Guillou ,  Jean-Jacques Quisquater

IPC: G06F7/72 ,  G07F7/10 ,  H04L9/32

CPC classification number: H04L9/3271 ,  G06Q20/341 ,  G06Q20/3674 ,  G06Q20/40975 ,  G07F7/0826 ,  G07F7/1008 ,  H04L9/302 ,  H04L9/3218 ,  H04L9/3263 ,  G06F7/725 ,  H04L2209/30

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 translation: 根据本发明，芯片卡发布包括其凭证字母（Crc），指数（X），可选消息（M））的第一证书，这些数量被签名。 安全模块验证签名，并返回发出包含其凭证字母（Crm），指数（Y），可选消息（M'），密码（C）的第二个证书，这些数量被签名。 通过指数在卡和安全模块之间构成一个共同的秘密密钥，并允许卡解释寻址给它的密码并根据其进行操作。

公开(公告)号：US07415614B2

公开(公告)日：2008-08-19

申请号：US10471884

申请日：2002-03-12

Applicant: Louis Guillou

Inventor： Louis Guillou

IPC: H04L9/00

CPC classification number: H04L9/3247 ,  H04L9/3033 ,  H04L9/3218

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 ≡1（mod n），通过所述签名私钥，Id和公共临时模块链接的短暂证书。 公共临时模块相对于签名私钥的尺寸减小。

公开(公告)号：US5442701A

公开(公告)日：1995-08-15

申请号：US172817

申请日：1993-12-27

Applicant: Louis Guillou ,  Jean-Luc Giachetti ,  Alain Gelly

Inventor： Louis Guillou ,  Jean-Luc Giachetti ,  Alain Gelly

IPC: H04N7/167

CPC classification number: H04N7/1675 ,  H04N21/2541 ,  H04N21/26613 ,  H04N21/4405 ,  H04N21/4623 ,  H04N21/4627 ,  H04N21/8453 ,  H04N21/8549

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 translation: 用于广播有条件访问程序的过程，允许逐行访问。 加扰的节目数据与部分访问检查消息和完整的访问检查消息一起发送，使得具有部分访问权限的订户可以解密与仅关于条件访问程序的身份的信息相对应的加扰数据的部分，以及具有完全访问权限的订户 权限可以解扰余下的加扰数据并查看条件访问程序。 条件访问程序可以是电视图像，无线电节目或数据广播。

公开(公告)号：US4947428A

公开(公告)日：1990-08-07

申请号：US350793

申请日：1989-05-12

Applicant: Louis Guillou ,  Joseph Blineau ,  Francoise Coutrot ,  Vincent Lenoir

Inventor： Louis Guillou ,  Joseph Blineau ,  Francoise Coutrot ,  Vincent Lenoir

IPC: H04L9/32 ,  H04N7/167

CPC classification number: H04N7/1675 ,  H04N21/26613 ,  H04N21/4181 ,  H04N21/64

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 translation: 根据本发明，控制消息由通用寻址消息（GCM）构成，随后是共享寻址消息（SACM）。 消息（GCM）包含所有用户组通用的所有信息以及用户组的确认数据项和消息（SACM）共享地址。 因此，该组以控制消息中固有的方式定义，并且可以在任何时候经历重新配置。 更适用于电视节目的卫星广播。

公开(公告)号：US07680271B2

公开(公告)日：2010-03-16

申请号：US10587460

申请日：2005-01-24

Applicant: Louis Guillou ,  Jean-Jacques Quisquater

Inventor： Louis Guillou ,  Jean-Jacques Quisquater

IPC: H04L9/00 ,  H04L9/30

CPC classification number: H04L9/3213 ,  H04L9/3033 ,  H04L9/3218 ,  H04L9/3271

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 translation: 涉及具有m≥1个私钥Q1，Q2的密钥持有者的密码方法。 。 。 ，Qm和相应的公钥G1，G2。 。 。 ，Gm，满足关系G1 = Qiv mod n或关系Gi×Qiv = 1 mod n的每对键（Qi，Gi）（其中i = 1，...，m），其中n是公共整数 等于f（其中f> 1）私人素因子p1的乘积。 。 。 ，pf，其中至少两个是分开的，并且指数v是等于2的幂的公共整数。公开了可以向公钥赋予什么数学结构，使得不可能从所述公钥计算所述私钥 公共参数在合理的时间，除非所述素数因素是已知的。 还公开了适于实现该方法的设备。

公开(公告)号：US07386122B1

公开(公告)日：2008-06-10

申请号：US09889918

申请日：2000-01-27

Applicant: Louis Guillou ,  Jean-Jacques Quisquater

Inventor： Louis Guillou ,  Jean-Jacques Quisquater

IPC: H04L9/32 ,  H04L9/30 ,  H04K1/00 ,  H04L9/16

CPC classification number: H04L9/3218

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 是小于f first的基数g i i i i的平方根1 2 因子p ，使得两个等式：x2 = g i mod n和x 2 = - g 1 > mod n在模n整数的环中的x中没有解，并且使得等式x = g <1> mod n在x整数的环中具有x的解。

公开(公告)号：US07080254B1

公开(公告)日：2006-07-18

申请号：US10089662

申请日：2000-09-29

Applicant: Louis Guillou ,  Jean-Jacques Quisquater

Inventor： Louis Guillou ,  Jean-Jacques Quisquater

IPC: H04L9/30

CPC classification number: H04L9/302 ,  H04L9/3218 ,  H04L9/3249

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 值; 由f（> = 2）因子的乘积形成的公共模块n; 指数v = 2（k> 1），其通过以下类型的关系链接：G ≡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的解。}

公开(公告)号：US5742681A

公开(公告)日：1998-04-21

申请号：US415987

申请日：1995-04-04

Applicant: Jean-Luc Giachetti ,  Louis Guillou ,  Jean-Claude Pacaud

Inventor： Jean-Luc Giachetti ,  Louis Guillou ,  Jean-Claude Pacaud

IPC: H04N7/167

CPC classification number: H04N21/23476 ,  H04N7/1675

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 translation: 用于广播具有逐步条件访问和分离信息流的程序的过程以及相应的接收机。为了形成基本流程，采用多路复用的m个连续元素的组，并形成互补的流组 采用多路复用的p个连续元素。 适用于有权享受检查的电视。

公开(公告)号：US4797919A

公开(公告)日：1989-01-10

申请号：US934872

申请日：1986-11-25

Applicant: Bruce Murray ,  Louis Guillou ,  Francoise M. R. Coutrot

Inventor： Bruce Murray ,  Louis Guillou ,  Francoise M. R. Coutrot

IPC: H04N7/10 ,  H04N7/03 ,  H04N7/08 ,  H04N7/083 ,  H04N7/167 ,  H04L9/04

CPC classification number: H04N7/03 ,  H04N21/4623 ,  H04N7/08 ,  H04N7/083 ,  H04N7/1675

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.

Abstract translation: 具有用于电视电路和条件访问子系统之间的连接的接口布置的接收机经由具有四帧总线周期周期的总线以与线路速率对应的比特率来传送数据。 在总线周期的第一部分期间，数据从接收机顺序地传送到子系统，如下所述：i。 1字节的地址块，与接收机通信的子系统的唯一地址，ii。 1字节的状态块，提供第一部分中以下块的状态信息，iii，iv，v。 每个93字节的三个数据块，每个包含授权消息，vi。 1字节传输键盘或遥控命令的键控块，vii，viii。 传送帧计数信息的1/2字节（vii）或21/2字节（vii + viii）的另一个块。 在包括30或28字节的总线周期的第二和剩余部分期间，根据其他块的长度，数据从子系统发送到接收机。