专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO03055134A9 CRYPTOGRAPHIC METHOD FOR DISTRIBUTING LOAD AMONG SEVERAL ENTITIES AND DEVICES THEREFOR 审中-公开
标题翻译：用于分配几个实体的负载的CRYPTOGRAPHIC方法及其设备
公开(公告)号：WO03055134A9
公开(公告)日：2004-07-15
申请号：PCT/FR0204366
申请日：2002-12-16
申请人： FRANCE TELECOM , MATH RISZK , GIRAULT MARC , QUISQUATER JEAN-JACQUES
发明人： GIRAULT MARC , QUISQUATER JEAN-JACQUES
IPC分类号： G09C1/00 , H04L9/32
CPC分类号： H04L9/302 , H04L9/3218 , H04L2209/56 , H04L2209/80
摘要： The invention concerns a cryptographic method whereby a second entity (B) verifies by means of a public key, a proof provided by a first entity (A), which consists in the generation by the first entity (A) of a first random number r much higher than any first integer s included in a private key kept secret by the first entity (A). The first entity (A) generates a first element of proof resulting from a modulo n exponentiation of a first integer G included or not in said public key and whereof the exponent is the first random number r. In combination with the first element of proof, a so-called common number, is generated so that the second entity (B) and the first entity (A) should have knowledge of the common number. The first entity (A) generates an image y of said private key by linear combination of the first random number r and of at least a first private key integer s. At least a multiplicative coefficient of the linear combination is said common number. Any one entity generates a second element of proof Y equal to a power modulo n of a second integer G included or not in said public key and whereof the exponent is the image y of said common number, and sends the second element of proof Y to the first entity (B). The second entity (B) verifies whether the first element of proof is in conformity with a product modulo n of a power of the second element of proof Y whereof the exponent is a third integer e and of a power of a fourth integer v included in said public key whereof the exponent is said common number c.
摘要翻译：本发明涉及一种加密方法，其中第二实体（B）通过公开密钥来验证由第一实体（A）提供的证明，其包括由第一实体（A）生成第一随机数r 比包含在由第一实体（A）保密的私钥中的任何第一整数高得多。第一实体（A）产生由包括或不包括在所述公共密钥中的第一整数G的模n取幂产生的证明的第一元素，并且其中指数是第一随机数r。结合第一个证明要素，产生所谓的公共号码，使得第二实体（B）和第一实体（A）应该具有公共号的知识。第一实体（A）通过第一随机数r和至少第一私钥整数s的线性组合产生所述私钥的图像y。至少线性组合的乘法系数是所述公共数。任何一个实体生成等于包括或不包含在所述公共密钥中的第二整数G的幂模n的第二校验元素Y，并且其中指数是所述公用号的图像y，并且将第二检验要素Y发送到第一个实体（B）。第二实体（B）验证第一个证据元素是否符合第二个证据元素Y的权力的乘积n，其中指数是第三个整数e，第四个整数v包含在第四个整数v的幂中所谓的公钥是指数的公共号码c。

2. 发明申请

WO0046947A3 METHOD, SYSTEM, DEVICE FOR PROVING THE AUTHENTICITY OF AN ENTITY AND/OR THE INTEGRITY AND/OR THE AUTHENTICITY OF A MESSAGE USING SPECIFIC PRIME FACTORS 审中-公开
标题翻译：用于确定实体的正确性和/或完整性的方法，系统，设备和/或使用特定主要因素的消息的正确性
公开(公告)号：WO0046947A3
公开(公告)日：2002-04-04
申请号：PCT/FR0000189
申请日：2000-01-27
申请人： FRANCE TELECOM , TELEDIFFUSION FSE , MATH RIZK , GUILLOU LOUIS , QUISQUATER JEAN JACQUES
发明人： GUILLOU LOUIS , QUISQUATER JEAN-JACQUES
IPC分类号： G09C1/00 , H04L20060101 , H04L1/00 , H04L9/28 , H04L9/32
CPC分类号： H04L9/3218
摘要： The proof is provided by means of the following parameters: a public module n formed by the product of f prime factors pi, f>2; a public superscript v; m base numbers gi, m>1. The base numbers gi are such that the two equations: x gi mod n and x -gi mod n cannot de solved in x in the ring of integers modulo n, and such that the equation x gi mod n can be solved in x in the ring of integers modulo n in the case where the public superscript v is in the form v = 2 , wherein k is a security parameter.
摘要翻译：通过以下参数提供证明：由f因子pi，f> 2的乘积形成的公共模块n; 公开上标v m基数gi，m> 1。基数gi使得在整数n的环中x不能在x中解决两个方程：x 2 gi mod n和x 2 -i mod mod n，并且使得方程式x≠gi 在公共上标v为v = 2 k的形式的情况下，可以在整数n的整数环中的x中求解mod n，其中k是安全参数。

3. 发明申请

WO0045550A3 Method for proving the authenticity or integrity or a message by means of a public exponent equal to the power of two 审中-公开
标题翻译：通过公共指数证明其真实性或完整性的方法或者等于两者权力的公开指数的方法
公开(公告)号：WO0045550A3
公开(公告)日：2002-04-25
申请号：PCT/FR0000190
申请日：2000-01-27
申请人： FRANCE TELECOM , TELEDIFFUSION FSE , MATH RIZK , GUILLOU LOUIS , QUISQUATER JEAN-JACQUES
发明人： GUILLOU LOUIS , QUISQUATER JEAN-JACQUES
IPC分类号： G09C1/00 , H04L20060101 , H04L1/00 , H04L9/28 , H04L9/32
CPC分类号： H04L9/3218
摘要： The proof is provided by means of the following parameters: a public module n formed by the product of f prime factors p i , f>2; a public superscript v; m base numbers g i , m>1. The base numbers g i are such that the two equations: x 2 ≡g i mod n and x 2 ≡-g i mod n cannot de solved in x in the ring of integers modulo n, and such that the equation x v ≡g i 2 mod n can be solved in x in the ring of integers modulo n in the case where the public superscript v is in the form v=2 k , wherein k is a security parameter.
摘要翻译：证明是通过以下参数来提供的：由f因子p ，f> 2的乘积形成的公共模块n; 公开上标v m个碱基数m，m> 1。基数g i i使得以下两个等式：x 2 mod n和x 2 在模n的整数环中，不能在x中求解≡-g≠mod n，并且使得等式x≡g< 在公共上标v的形式为v = 2K的情况下，可以在整数n的整数环中的x中求解，其中k是安全参数。

4. 发明申请

WO0046946A3 METHOD, SYSTEM, DEVICE FOR PROVING THE AUTHENTICITY OF AN ENTITY AND/OR THE INTEGRITY AND/OR THE AUTHENTICITY OF A MESSAGE 审中-公开
标题翻译：方法，系统，用于确定实体的正确性和/或完整性和/或消息的正当性的设备
公开(公告)号：WO0046946A3
公开(公告)日：2002-10-10
申请号：PCT/FR0000188
申请日：2000-01-27
申请人： FRANCE TELECOM , TELEDIFFUSION FSE , MATH RIZK , GUILLOU LOUIS , QUISQUATER JEAN-JACQUES
发明人： GUILLOU LOUIS , QUISQUATER JEAN-JACQUES
IPC分类号： G09C1/00 , H04L20060101 , H04L1/00 , H04L9/28 , H04L9/32
CPC分类号： H04L9/3218
摘要： The proof is provided by the following parameters: m pairs of private values Qi and public values Pi, m>1; a public module n formed by the product of f first factors pi, f>2; a public exponent v, bound by the relationship of the type: Gi.Qi mod n or Gi Qi mod n.
摘要翻译：证明由以下参数提供：m对私有值Qi和公共值Pi，m> 1; 由第一因子pi，f> 2的乘积形成的公共模块n; 公共指数v，由类型：Gi.Qi mod n或Gi Qi mod n的关系约束。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式