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

1. 发明授权

US09772821B2 Cryptography method comprising an operation of multiplication by a scalar or an exponentiation 有权
公开(公告)号：US09772821B2
公开(公告)日：2017-09-26
申请号：US14762010
申请日：2014-01-13
申请人： INSIDE SECURE
发明人： Benoît Feix , Vincent Verneuil , Christophe Clavier
IPC分类号： G06F7/72 , H04L9/30 , H04L9/32
CPC分类号： G06F7/725 , G06F2207/7252 , H04L9/3066 , H04L9/3236
摘要： A cryptographic data processing method, implemented in an electronic device including a processor, the method including steps of providing a point of an elliptic curve in a Galois field, and a whole number, and of calculating a scalar product of the point by the number, the coordinates of the point and the number having a size greater than the size of words that may be processed directly by the processor, the scalar multiplication of the point by the number including steps of: storing scalar multiples of the point multiplied-by the number 2 raised to a power belonging to a series of whole numbers, setting a resulting point for each non-zero bit of the first number, adding the resulting point and one of the stored multiple points, and providing at the output of the processor the resulting point as result of the scalar product.

2. 发明授权

US09577826B2 Method of generating proven prime numbers suitable for being implemented in a smart card 有权
标题翻译：产生适合于在智能卡中实现的已验证素数的方法
公开(公告)号：US09577826B2
公开(公告)日：2017-02-21
申请号：US14365671
申请日：2012-12-12
申请人： INSIDE SECURE
发明人： Benoît Feix , Christophe Clavier , Pascal Paillier , Loïc Thierry
IPC分类号： H04L9/08 , G06F7/58 , G06F7/72 , G06F17/11
CPC分类号： H04L9/0869 , G06F7/58 , G06F7/72 , G06F17/11 , G06F2207/7204 , H04L9/0816 , H04L2209/24
摘要： The invention relates to a method for generating a prime number, implemented in an electronic device, the method including steps of generating a prime number from another prime number using the formula Pr=2P·R+1, where P is a prime number having a number of bits lower than that of the candidate prime number, and R is an integer, and applying the Pocklington primality test to the candidate prime number, the candidate prime number being proven if it passes the Pocklington test. According to the invention, the size in number of bits of the candidate prime number is equal to three times the size of the prime number, to within one unit, the generated candidate prime number being retained as candidate prime number only if the quotient of the integer division of the integer by the prime number is odd.
摘要翻译：本发明涉及一种在电子设备中实现的素数的产生方法，该方法包括以下步骤：使用公式Pr = 2P·R + 1从另一个素数生成素数，其中P是具有比特数低于候选素数，R为整数，并且对候选质数进行Pocklington原语测试，如果候选素数通过Pocklington检验，则验证候选素数。根据本发明，候选素数的比特数的大小等于素数大小的三倍，在一个单位内，所生成的候选素数保留为候选素数，只有当商数整数除以素数的整数除以奇数。

3. 发明授权

US09405729B2 Cryptographic method comprising a modular exponentiation operation 有权
标题翻译：包括模幂运算的加密方法
公开(公告)号：US09405729B2
公开(公告)日：2016-08-02
申请号：US14072155
申请日：2013-11-05
申请人： INSIDE SECURE
发明人： Christophe Clavier , Vincent Verneuil
IPC分类号： G06F17/10 , G06F7/72 , H04L9/00 , H04L9/30
CPC分类号： G06F17/10 , G06F7/723 , G06F2207/7261 , G06F2207/7266 , G06F2207/729 , H04L9/003 , H04L9/302 , H04L9/3046 , H04L2209/08
摘要： The present invention relates to a method for performing an iterative calculation of exponentiation of a large datum, the method being implemented in an electronic device (DV1) and comprising calculations of squaring and multiplying large variables performed in parallel, by squaring (SB1) and multiplication (SM1) blocks, the method comprising steps of: while a temporary storage buffer memory is not full of unused squares, triggering a calculation by the squaring block for a bit of the exponent, when the squaring block is inactive, storing each square provided by the squaring block in the buffer memory, if the bit of the corresponding exponent is on 1, and while the buffer memory contains an unused square, triggering a calculation by the multiplication block concerning the unused square, when the multiplication block is inactive.
摘要翻译：本发明涉及一种用于执行大数据的取幂的迭代计算的方法，该方法在电子设备（DV1）中实现，并且包括通过平方（SB1）和乘法来并行执行的大变量的平方和相乘的计算（SM1）块，所述方法包括以下步骤：当临时存储缓冲存储器未填满未使用的正方形时，当平方块不活动时，触发平方块对于指数位的平方块的计算，存储由缓冲存储器中的平方块，如果相应指数的位为1，并且当缓冲存储器包含未使用的平方时，则当乘法块不活动时，触发由乘法块对未使用的平方的计算。

4. 发明申请

US20140355758A1 METHOD OF GENERATING PRIME NUMBERS PROVEN SUITABLE FOR CHIP CARDS 有权
标题翻译：生成适用于芯片卡的主要编号的方法
公开(公告)号：US20140355758A1
公开(公告)日：2014-12-04
申请号：US14365899
申请日：2012-12-12
申请人： INSIDE SECURE
发明人： Benoît Feix , Christophe Clavier , Pascal Paillier , Loïc Thierry
IPC分类号： H04L9/08
CPC分类号： H04L9/0869 , G06F7/58 , G06F7/72 , G06F17/11 , G06F2207/7204 , H04L9/0816 , H04L2209/24
摘要： The invention relates to a method for generating a prime number, implemented in an electronic device, the method including steps of calculating a candidate prime number having a number of bits, using the formula: Pr=2P·R+1, where P is a prime number and R is an integer, applying the Pocklington primality test to the candidate prime number, rejecting the candidate prime number if it fails the Pocklington test, generating the integer from an invertible number belonging to a set of invertible elements modulo the product of numbers belonging to a group of small prime numbers greater than 2, so that the candidate prime number is not divisible by any number of the group, the prime number P having a number of bits equal, to within one bit, to half or a third of the number of bits of the candidate prime number.
摘要翻译：本发明涉及一种在电子设备中实现的素数生成方法，该方法包括以下步骤：使用下式计算具有多个比特数的候选素数：Pr = 2P·R + 1，其中P为素数，R是整数，将Pocklington原语测试应用于候选素数，如果Pocklington测试失败，则拒绝候选素数，从属于一组可逆元素的可逆数生成整数，该可逆元素模数为数字乘积属于大于2的小素数的组，使得候选质数不能被组的任何数量整除，素数P的位数相等，在一位内的一半或三分之一候选素数的比特数。

5. 发明授权

US09596080B2 Method of generating prime numbers proven suitable for chip cards 有权
标题翻译：产生证明适合芯片卡的素数的方法
公开(公告)号：US09596080B2
公开(公告)日：2017-03-14
申请号：US14365899
申请日：2012-12-12
申请人： INSIDE SECURE
发明人： Benoît Feix , Christophe Clavier , Pascal Paillier , Loïc Thierry
IPC分类号： H04L9/08 , G06F7/58 , G06F7/72 , G06F17/11
CPC分类号： H04L9/0869 , G06F7/58 , G06F7/72 , G06F17/11 , G06F2207/7204 , H04L9/0816 , H04L2209/24
摘要： This disclosure relates to methods for generating a prime number, which can be implemented in an electronic device. An example method can include calculating a candidate prime number using a formula Pr=2P·R+1, where P is a prime number and R is an integer. The method can also include applying the Pocklington primality test to the candidate prime number and rejecting the candidate prime number if it fails the Pocklington test. The integer can be generated from an invertible number belonging to a set of invertible elements modulo the product of numbers belonging to a group of small prime numbers greater than 2, where the candidate prime number is not divisible by any number of the group. The prime number P having a number of bits equal to within one bit, to half or a third of the number of bits of the candidate prime number.
摘要翻译：本公开涉及可以在电子设备中实现的用于生成素数的方法。示例性方法可以包括使用公式Pr = 2P·R + 1来计算候选素数，其中P是素数，R是整数。该方法还可以包括将Pocklington原语测试应用于候选素数，如果Pocklington测试失败，则拒绝候选素数。该整数可以从属于一组可逆元素的可逆数生成，该可逆元素模数属于小于2的小数的一组的乘积的乘积，其中候选素数不能被该组的任何数量整除。素数P具有等于一位内的位数，至候选素数的比特数的一半或三分之一。

6. 发明申请

US20140358980A1 METHOD OF GENERATING PROVEN PRIME NUMBERS SUITABLE FOR BEING IMPLEMENTED IN A SMART CARD 有权
标题翻译：产生适用于智能卡实施的现有主要编号的方法
公开(公告)号：US20140358980A1
公开(公告)日：2014-12-04
申请号：US14365671
申请日：2012-12-12
申请人： INSIDE SECURE
发明人： Benoît Feix , Christophe Clavier , Pascal Paillier , Loïc Thierry
IPC分类号： G06F17/11
CPC分类号： H04L9/0869 , G06F7/58 , G06F7/72 , G06F17/11 , G06F2207/7204 , H04L9/0816 , H04L2209/24
摘要： The invention relates to a method for generating a prime number, implemented in an electronic device, the method including steps of generating a prime number from another prime number using the formula Pr=2P·R+1, where P is a prime number having a number of bits lower than that of the candidate prime number, and R is an integer, and applying the Pocklington primality test to the candidate prime number, the candidate prime number being proven if it passes the Pocklington test. According to the invention, the size in number of bits of the candidate prime number is equal to three times the size of the prime number, to within one unit, the generated candidate prime number being retained as candidate prime number only if the quotient of the integer division of the integer by the prime number is odd.
摘要翻译：本发明涉及一种在电子设备中实现的素数的产生方法，该方法包括以下步骤：使用公式Pr = 2P·R + 1从另一个素数生成素数，其中P是具有比特数低于候选素数，R为整数，并且对候选质数进行Pocklington原语测试，如果候选素数通过Pocklington检验，则验证候选素数。根据本发明，候选素数的比特数的大小等于素数大小的三倍，在一个单位内，所生成的候选素数保留为候选素数，只有当商数整数除以素数的整数除以奇数。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式