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

1. 发明申请

US20060210066A1 Method for the secure application of a cryptographic algorithm of the rsa type and a corresponding component 失效
标题翻译：用于安全应用rsa类型和对应组件的密码算法的方法
公开(公告)号：US20060210066A1
公开(公告)日：2006-09-21
申请号：US10566504
申请日：2004-07-08
申请人： Karine Villegas , Marc Joye , Bewnoit Chevallier-Mames
发明人： Karine Villegas , Marc Joye , Bewnoit Chevallier-Mames
IPC分类号： H04L9/28
CPC分类号： G06F7/723 , G06F2207/7242 , G06F2207/7257 , G06F2207/7271 , H04L9/003 , H04L9/004 , H04L9/302 , H04L2209/26
摘要： A method for the secure application of a cryptographic algorithm of the RSA type in an electronic component obtains the value of a public exponent e from a given set of probable values, without a priori knowledge of that value. Having determined the value for the public exponent e, the application of countermeasures using the value of e, to block error attacks and side channel attacks, particularly of the DPA and SPA type, are carried out on the application of a private operation of the cryptographic algorithm.
摘要翻译：用于在电子组件中安全地应用RSA类型的加密算法的方法从给定的一组可能值获得公众指数e的值，而没有该值的先验知识。在确定了公众指数e的价值后，使用e值的阻止错误攻击和侧向信道攻击（特别是DPA和SPA类型）的应用应用于密码学的私有操作算法。

2. 发明申请

US20060133603A1 Integer division method which is secure against covert channel attacks 有权
标题翻译：整数分割方法，可以防范隐蔽通道攻击
公开(公告)号：US20060133603A1
公开(公告)日：2006-06-22
申请号：US10534873
申请日：2003-11-13
申请人： Marc Joye , Karine Villegas
发明人： Marc Joye , Karine Villegas
IPC分类号： H04L9/28 , H04L9/00
CPC分类号： G06F7/535 , G06F7/72 , G06F2207/7261 , H04L9/003 , H04L9/302
摘要： The invention relates to a cryptographic method involving an integer division of type q=a div b and r=a mod b, wherein a is a number of m bits, b is a number of n bits, with n being less than or equal to m, and bn−1 being non-null and the most significant bit of b. In addition, each iteration of a loop subscripted by i, which varies between 1 and m−n+1, involves a partial division of a word A of n bits of number a by number b in order to obtain one bit of quotient q. According to the invention, the same operations are performed with each iteration, regardless of the value of the quotient bit obtained. In different embodiments of the invention, one of the following is also performed with each iteration: the addition and subtraction of number b to/from word A; the addition of number b or a complementary number /b of b to word A; or a complement operation at 2n of an updated datum (b or /b) or a dummy datum (c or /c) followed by the addition of the datum updated with word A.
摘要翻译：本发明涉及一种包含类型为q = a div b和r = a mod b的整数除法的密码方法，其中a是m比特数，b是n比特数，n小于或等于 m和b n-1 1是非空的，b的最高有效位。另外，在i和m-n + 1之间变化的由i下标的循环的每次迭代都涉及到数字a的n位的字A的部分划分，以便获得一个位q。根据本发明，与每个迭代执行相同的操作，而不管获得的商位的值如何。在本发明的不同实施例中，每次迭代还执行以下之一：对于字A的数字b的加和减; 在字A中添加数字b或补数b / b; 或更新的数据（b或/ b）或虚拟数据（c或/ c）的2“的补码操作，然后添加用字A更新的数据。

3. 发明授权

US08233614B2 Integer division method secure against covert channel attacks 有权
标题翻译：整数分割法可以防范隐蔽通道攻击
公开(公告)号：US08233614B2
公开(公告)日：2012-07-31
申请号：US10534873
申请日：2003-11-13
申请人： Marc Joye , Karine Villegas
发明人： Marc Joye , Karine Villegas
IPC分类号： H04K1/00 , H04L9/00 , H04L9/28
CPC分类号： G06F7/535 , G06F7/72 , G06F2207/7261 , H04L9/003 , H04L9/302
摘要： The invention relates to a cryptographic method involving an integer division of type q=a div b and r=a mod b, wherein a is a number of m bits, b is a number of n bits, with n being less than or equal to m, and bn−1 being non-null and the most significant bit of b. In addition, each iteration of a loop subscripted by i, which varies between 1 and m−n+1, involves a partial division of a word A of n bits of number a by number b in order to obtain one bit of quotient q. According to the invention, the same operations are performed with each iteration, regardless of the value of the quotient bit obtained. In different embodiments of the invention, one of the following is also performed with each iteration: the addition and subtraction of number b to/from word A; the addition of number b or a complementary number /b of b to word A; or a complement operation at 2n of an updated datum (b or /b) or a dummy datum (c or /c) followed by the addition of the datum updated with word A.
摘要翻译：本发明涉及一种包含类型为q = a div b和r = a mod b的整数除法的密码方法，其中a是m比特数，b是n比特数，n小于或等于 m和bn-1是非空的，b的最高有效位。另外，在i和m-n + 1之间变化的由i下标的循环的每次迭代都涉及到数字a的n位的字A的部分划分，以便获得一个位q。根据本发明，与每个迭代执行相同的操作，而不管获得的商位的值如何。在本发明的不同实施例中，每次迭代还执行以下之一：对于字A的数字b的加和减; 在字A中添加数字b或补数b / b; 或在更新的数据（b或/ b）或虚拟数据（c或/ c）的2n处的补码操作，随后添加用词A更新的数据。

4. 发明申请

US20080144814A1 Method of securely implementing a cryptography algorithm of the RSA type, and a corresponding component 失效
公开(公告)号：US20080144814A1
公开(公告)日：2008-06-19
申请号：US12071571
申请日：2008-02-22
申请人： Karine Villegas , Marc Joye , Benoit Chevallier-Mames
发明人： Karine Villegas , Marc Joye , Benoit Chevallier-Mames
IPC分类号： H04L9/30 , G06F7/72 , H04L9/28
CPC分类号： G06F7/723 , G06F2207/7242 , G06F2207/7257 , G06F2207/7271 , H04L9/003 , H04L9/004 , H04L9/302 , H04L2209/26
摘要： A method for the secure application of a cryptographic algorithm of the RSA type in an electronic component obtains the value of a public exponent e from a given set of probable values, without a priori knowledge of that value. Having determined the value for the public exponent e, the application of countermeasures using the value of e, to block error attacks and side channel attacks, particularly of the DPA and SPA type, are carried out on the application of a private operation of the cryptographic algorithm.

5. 发明授权

US07386123B2 Method of implementing in an electronic component a cryptographic algorithm for finding the public exponent 有权
标题翻译：在电子部件中实现用于发现公众指数的加密算法的方法
公开(公告)号：US07386123B2
公开(公告)日：2008-06-10
申请号：US10490413
申请日：2002-09-05
申请人： Marc Joye , Pascal Paillier , Florence Ques-Rochat , Karine Villegas , Nathalie Feyt , Benoit Chevallier Mames
发明人： Marc Joye , Pascal Paillier , Florence Ques-Rochat , Karine Villegas , Nathalie Feyt , Benoit Chevallier Mames
IPC分类号： H04L9/30
CPC分类号： G06F7/723 , G06F2207/7271 , H04L9/004 , H04L9/302 , H04L2209/26
摘要： The invention concerns a method for implementing in an electronic component a cryptographic algorithm using calculating means. The invention is characterized in that it consists in carrying out the following steps: a) selecting a value e among a specific number of values eI, ei being integers, b) checking if ei verifies a predetermined relationship: if so, then e=ei, and storing e for use in calculating said cryptographic algorithm.
摘要翻译：本发明涉及一种使用计算装置在电子部件中实现加密算法的方法。本发明的特征在于，它包括执行以下步骤：a）选择特定数量的值e i i i i i i i i e i i i i i i i i i i i i i i i ）检查是否验证预定的关系：如果是，则e = e i i i，并存储用于计算所述密码算法的e。

6. 发明授权

US07860242B2 Method of securely implementing a cryptography algorithm of the RSA type, and a corresponding component 失效
标题翻译：安全实施RSA类型加密算法的方法，以及相应的组件
公开(公告)号：US07860242B2
公开(公告)日：2010-12-28
申请号：US12071571
申请日：2008-02-22
申请人： Karine Villegas , Marc Joye , Benoit Chevallier-Mames
发明人： Karine Villegas , Marc Joye , Benoit Chevallier-Mames
IPC分类号： H04L9/28
CPC分类号： G06F7/723 , G06F2207/7242 , G06F2207/7257 , G06F2207/7271 , H04L9/003 , H04L9/004 , H04L9/302 , H04L2209/26
摘要： A method for the secure application of a cryptographic algorithm of the RSA type in an electronic component obtains the value of a public exponent e from a given set of probable values, without a priori knowledge of that value. Having determined the value for the public exponent e, the application of countermeasures using the value of e, to block error attacks and side channel attacks, particularly of the DPA and SPA type, are carried out on the application of a private operation of the cryptographic algorithm.
摘要翻译：用于在电子组件中安全地应用RSA类型的加密算法的方法从给定的一组可能值获得公众指数e的值，而没有该值的先验知识。在确定了公众指数e的价值后，使用e值的阻止错误攻击和侧向信道攻击（特别是DPA和SPA类型）的应用应用于密码学的私有操作算法。

7. 发明授权

US07359508B2 Method of securely implementing a cryptography algorithm of the RSA type, and a corresponding component 失效
标题翻译：安全实施RSA类型加密算法的方法，以及相应的组件
公开(公告)号：US07359508B2
公开(公告)日：2008-04-15
申请号：US10566504
申请日：2004-07-08
申请人： Karine Villegas , Marc Joye , Benoit Chevallier-Mames
发明人： Karine Villegas , Marc Joye , Benoit Chevallier-Mames
IPC分类号： H04L9/30
CPC分类号： G06F7/723 , G06F2207/7242 , G06F2207/7257 , G06F2207/7271 , H04L9/003 , H04L9/004 , H04L9/302 , H04L2209/26
摘要： A method for the secure application of a cryptographic algorithm of the RSA type in an electronic component obtains the value of a public exponent e from a given set of probable values, without a priori knowledge of that value. Having determined the value for the public exponent e, the application of countermeasures using the value of e, to block error attacks and side channel attacks, particularly of the DPA and SPA type, are carried out on the application of a private operation of the cryptographic algorithm.
摘要翻译：用于在电子组件中安全地应用RSA类型的加密算法的方法从给定的一组可能值获得公众指数e的值，而没有该值的先验知识。在确定了公众指数e的价值后，使用e值的阻止错误攻击和侧向信道攻击（特别是DPA和SPA类型）的应用应用于密码学的私有操作算法。

8. 发明授权

US08744072B2 Exponentiation method resistant against side-channel and safe-error attacks 有权
标题翻译：指数方法抵御侧向通道和安全错误攻击
公开(公告)号：US08744072B2
公开(公告)日：2014-06-03
申请号：US13138584
申请日：2010-03-01
申请人： Marc Joye
发明人： Marc Joye
IPC分类号： H04K1/00 , H04L9/00 , H04L9/28 , H04L9/30 , G06F7/72 , G06F7/38
CPC分类号： H04L9/002 , G06F7/38 , G06F7/72 , G06F7/723 , G06F7/724 , G06F7/728 , G06F2207/7261 , H04L9/003 , H04L9/004 , H04L9/30 , H04L9/3066
摘要： An exponentiation method resistant against side-channel attacks and safe-error attacks. Input to the method is g in a multiplicatively written group G and a /-digit exponent d with a radix m>1 and output is z=gd-1·(d−1) is expressed as a series of (/−1) non-zero digits, d*0 . . . d*I-2, in the set {m−1, . . . , 2m−2} and an extra digit d*I-1 that is equal to dI-1−1, where dI-1 represents the most significant radix-m digit of d, and gd-1 is evaluated through a m-ary exponentiation algorithm on input g and (d−1) represented by d*0 . . . d*I-1. Also provided are an apparatus and a computer program product.
摘要翻译：一种抗侧向攻击和安全错误攻击的取幂方法。该方法的输入为g，乘法编写的组G和a / -digit指数d，基数m> 1，输出为z = gd-1·（d-1）表示为一系列（/ -1）非零数字，d * 0。。。 d * I-2，在集合{m-1，。。。，2m-2}和等于dI-1-1的额外数字d * I-1，其中dI-1表示d的最显着的rad-m数字，并且gd-1通过m-ar 由d * 0表示的输入g和（d-1）的求幂算法。。。 d * I-1。还提供了一种装置和计算机程序产品。

9. 发明授权

US08548162B2 Method and a device for performing torus-based cryptography 失效
标题翻译：方法和用于执行基于环面的密码学的设备
公开(公告)号：US08548162B2
公开(公告)日：2013-10-01
申请号：US13377663
申请日：2010-06-10
申请人： Marc Joye
发明人： Marc Joye
IPC分类号： H04L9/00
CPC分类号： H04L9/3013 , H04L9/302 , H04L9/3255 , H04L2209/12 , H04L2209/30
摘要： At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. The present invention extends their setting to the ring of integers modulo N, thus obtaining compact representations for cryptographic systems that base their security on the discrete logarithm problem and the factoring problem. This can result in small key sizes and substantial savings in memory and bandwidth. However, unlike the case of finite field, analogous trace-based compression methods cannot be adapted to accommodate the extended setting of the invention when the underlying systems require more than a mere exponentiation. The invention finds particular application in a torus-based implementation of the ACJT group signature scheme. Also provided is a processor.
摘要翻译：在CRYPTO 2003年，Rubin和Silverberg在有限的领域上介绍了基于环面的加密技术的概念。本发明将它们的设置扩展到模N的整数环，从而获得基于离散对数问题和保理问题的安全性的密码系统的紧凑表示。这可能导致小的密钥大小，并显着节省内存和带宽。然而，与有限域的情况不同，当底层系统需要的不仅仅是求幂时，类似的基于跟踪的压缩方法不能适应于适应本发明的扩展设置。本发明在ACJT组签名方案的基于环面的实现中发现具体应用。还提供了处理器。

10. 发明授权

US08223963B2 Method and apparatus for generating a signature for a message and method and apparatus for verifying such a signature 有权
标题翻译：用于生成用于消息的签名的方法和装置以及用于验证这样的签名的方法和装置
公开(公告)号：US08223963B2
公开(公告)日：2012-07-17
申请号：US12737073
申请日：2009-06-02
申请人： Marc Joye
发明人： Marc Joye
IPC分类号： G06F21/00
CPC分类号： H04L9/3249 , H04L9/302 , H04L2209/56 , H04L2209/80
摘要： A method of generating a signature σ for a message m, the method enabling online/offline signatures. Two random primes p and q are generated, with N=pq; two random quadratic residues g and x are chosen in Z*N, and, for an integer z, h=g−z mod N is calculated. This gives the public key {g, h, x, N} and the private key {p, q, z}. Then, an integer t and a prime e are chosen. The offline signature part y may then be calculated as y=(xg−t)1/eb mod N where b is an integer bigger than 0, predetermined in the signature scheme. The online part k of the signature on message m is then calculated as k=t+mz and the signature σ on message m is generated as σ=(k, y, e) and returned. To verify the signature, it is checked that 1) e is an odd IE-bit integer, 2) k is an IK-bit integer, and 3) yebgkhm≡x(mod N). An advantage of the method is that it may be performed without hashing. Also provided are a signing device, a verification device, and computer program supports.
摘要翻译：生成签名和方法的方法对于消息m，该方法启用在线/离线签名。产生两个随机素数p和q，其中N = pq; 在Z * N中选择两个随机二次残差g和x，对于整数z，计算h = g-z mod N。这给出公钥{g，h，x，N}和私钥{p，q，z}。然后，选择整数t和素数e。然后可以将离线签名部分y计算为y =（xg-t）1 / eb mod N，其中b是大于0的整数，在签名方案中是预定的。然后，消息m上的签名的在线部分k被计算为k = t + mz和签名＆sgr; on消息m生成为＆sgr; =（k，y，e）并返回。为了验证签名，检查1）e是奇数IE位整数，2）k是IK位整数，以及3）yebgkhm≡x（mod N）。该方法的优点在于可以不进行散列来执行。还提供了签名装置，验证装置和计算机程序支持。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式