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

41. 发明申请

US20060147039A1 Data encryption method cryptographic system and associated component 审中-公开
标题翻译：数据加密方法加密系统及相关组件
公开(公告)号：US20060147039A1
公开(公告)日：2006-07-06
申请号：US10522420
申请日：2003-07-25
申请人： Jean-Sebastien Coron , Marc Joye , David Naccache , Pascal Paillier
发明人： Jean-Sebastien Coron , Marc Joye , David Naccache , Pascal Paillier
IPC分类号： H04L9/28
CPC分类号： H04L9/302 , H04L9/3249
摘要： An encryption method in which a clear message (m) is formatted with a formatting function (p), and in which the result of the formatting step is exponentiated using a public key (N, e) in accordance with the relationship c=μ(m)e mod N, c being an encrypted message, μ(m) being the result of the formatting step, and e and N elements of the public key. The formatting function (μ) is the PSS function. The invention is applicable to cryptography, for example of RSA type, for smart cards for instance.
摘要翻译：一种加密方法，其中清除消息（m）用格式化函数（p）格式化，并且其中格式化步骤的结果使用公钥（N，e）根据关系c = mu（ m）作为加密消息，作为格式化步骤的结果的mu（m），以及公开密钥的e和N个元素。格式化功能（mu）是PSS功能。本发明可应用于例如用于智能卡的RSA类型的密码学。

42. 发明申请

US20050084096A1 Method of implementing in an electronic component a cryptographic algorithm for finding the public exponent 有权
标题翻译：在电子部件中实现用于发现公众指数的加密算法的方法
公开(公告)号：US20050084096A1
公开(公告)日：2005-04-21
申请号：US10490413
申请日：2002-09-05
申请人： Marc Joye , Pascal Paillier , Florence Ques-Rochat , Kanine Villegas , Nathalie Feyt
发明人： Marc Joye , Pascal Paillier , Florence Ques-Rochat , Kanine Villegas , Nathalie Feyt
IPC分类号： G09C1/00 , G06F7/72 , H04L9/10 , H04L9/30 , H04L9/00
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。

43. 发明授权

US08700921B2 Fault-resistant exponentiation algorithm 有权
标题翻译：故障求幂算法
公开(公告)号：US08700921B2
公开(公告)日：2014-04-15
申请号：US13487457
申请日：2012-06-04
申请人： Marc Joye , Mohamed Karroumi
发明人： Marc Joye , Mohamed Karroumi
IPC分类号： H04L9/28 , H04K1/00
CPC分类号： G06F7/723 , G06F2207/7261 , G06F2207/7271 , H04L9/003 , H04L9/004 , H04L9/302 , H04L2209/122
摘要： A method for performing a m-ary right-to-left exponentiation using a base x, a secret exponent d and a modulus N, wherein m is a power of 2. A device having a processor and m+1 registers R[0]−R[m] in at least one memory: initializes register R[0] to h for a chosen value h, wherein the order of the value h is a divisor of m*(m−1)/2, register R[m] to x(m−1) and the registers other than R[0] and R[m] to the value h; updates register R[r] to R[r] times x, wherein r is the remainder of a division of d by (m−1) mod N; obtains a working exponent q that is the quotient of the division of d by (m−1); performs l iterations, starting at i=0, of: setting R[qi] to R[qi] times R[m] and raising R[m] to the power of m, where l is the length of q in base m and qi is the i-th digit of the representation of q in base m and ql−1 is non-zero; verifies the correctness of the result by checking that R[m] equals the product of registers R[0]-R[m−1] to the power of m−1; and outputs the product of R[j]j, where 1≦j≦m−1, only if the correctness is successfully verified.
摘要翻译：一种用于使用基数x，秘密指数d和模数N执行从右到左取幂的方法，其中m是2的幂。具有处理器并且m + 1寄存器R [0] 在至少一个存储器中的-R [m]：将寄存器R [0]初始化为h以选择值h，其中值h的顺序是m *（m-1）/ 2的除数，寄存器R [m ]到x（m-1）以及除R [0]和R [m]之外的寄存器到值h; 将寄存器R [r]更新为R [r]乘以x，其中r是d除以（m-1）mod N的余数的剩余部分; 得到一个工作指数q，即d（m-1）的除法的商; 从i = 0开始执行l次迭代，将R [qi]设置为R [qi]次R [m]，并将R [m]提高到m的幂，其中l是基本m中q的长度， qi是基数m中q的表示的第i位数，ql-1是非零; 通过检查R [m]等于寄存器R [0] -R [m-1]的乘积与m-1的幂来验证结果的正确性; 并输出R [j] j的乘积，其中1＆nlE; j＆nlE; m-1，只有正确性被成功验证。

44. 发明申请

US20130318624A1 METHOD AND DEVICE FOR CONTROLLING DISTRIBUTION OF LICENSES 审中-公开
标题翻译：用于控制许可证分发的方法和装置
公开(公告)号：US20130318624A1
公开(公告)日：2013-11-28
申请号：US13984068
申请日：2012-02-06
申请人： Antoine Monsifrot , Gwenael Doerr , Olivier Courtay , Antoine Robert , Marc Joye
发明人： Antoine Monsifrot , Gwenael Doerr , Olivier Courtay , Antoine Robert , Marc Joye
IPC分类号： G06F21/10
CPC分类号： G06F21/105 , G06F21/10
摘要： A method for controlling distribution of licenses, a license being for an excerpt of a content item, the content item comprising a set of continuous units, each excerpt comprising a subset of the set of continuous units, A device receives an identifier of a receiver of a license, and the license or a request to generate the license, the license or the request to generate the license comprising a content identifier and at least one indicator of the units covered by the license; retrieves stored information regarding licenses previously delivered to the receiver; compares a limit value for the content item with the stored information combined with information from the license or the request to generate the license; and allows the receiver access to the license only if the limit value is not exceeded by the stored information combined with information from the license or the request to generate the license Also provided is the device.
摘要翻译：一种用于控制许可证分发的方法，用于内容项目摘录的许可证，所述内容项目包括一组连续单元，每个摘录包括所述一组连续单元的子集。设备接收所述连续单元的接收者的标识符许可证，许可证或产生许可证的请求，许可证或生成许可证的请求，其包括内容标识符和许可证所涵盖的单元的至少一个指示符; 检索关于先前传送给接收者的许可证的存储信息; 将内容项的限制值与存储的信息结合来自许可证的信息或生成许可证的请求进行比较; 并且只有当存储的信息与来自许可证的信息或生成许可证的请求相结合的限制值不超过时，才允许接收者访问许可证。还提供了该设备。

45. 发明申请

US20130195267A1 PUBLIC KEY ENCRYPTION SYSTEM BASED ON THE QUADRATIC RESIDUOSITY ASSUMPTION 有权
标题翻译：公共密钥加密系统基于四次残差估计
公开(公告)号：US20130195267A1
公开(公告)日：2013-08-01
申请号：US13877946
申请日：2011-09-28
申请人： Davide Alessio , Marc Joye
发明人： Davide Alessio , Marc Joye
IPC分类号： H04L9/30
CPC分类号： H04L9/30
摘要： A public-key encryption system. Encryption of a k-bit plaintext m is performed by picking a random generating ciphertext and outputting the ciphertext. N is a non-prime integer (preferably the product of two primes p and q), y is an element in multiplicative group of integers modulo N, and k is an integer larger than 1, Decryption of ciphertext c using private key is performed by recovering such that holds and outputting plaintext m, wherein denotes the 2k-th power residue symbol modulo p, which is defined. Also provided are an encryption device and a decryption device. The encryption scheme provides better bandwidth than the Goldwasser-Micali encryption scheme.
摘要翻译：公钥加密系统。通过选择随机生成密文并输出密文来执行k比特明文m的加密。 N是非素数整数（优选地是两个素数p和q的乘积），y是模N的乘法乘法组中的元素，并且k是大于1的整数，使用私钥的密文c的解密由恢复这样保存并输出明文m，其中表示定义的第2k个功率余数符号模p。还提供了加密装置和解密装置。加密方案提供比Goldwasser-Micali加密方案更好的带宽。

46. 发明申请

US20120087491A1 A METHOD AND A DEVICE FOR PERFORMING TORUS-BASED CRYPTOGRAPHY 失效
标题翻译：一种用于执行基于多普勒频率分析的方法和装置
公开(公告)号：US20120087491A1
公开(公告)日：2012-04-12
申请号：US13377663
申请日：2010-06-10
申请人： Marc Joye
发明人： Marc Joye
IPC分类号： H04L9/28
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组签名方案的基于环面的实现中发现具体应用。还提供了处理器。

47. 发明申请

US20120039461A1 EXPONENTIATION METHOD RESISTANT AGAINST SIDE-CHANNEL AND SAFE-ERROR ATTACKS 有权
标题翻译：防止侧向通道和安全错误攻击的指导方法
公开(公告)号：US20120039461A1
公开(公告)日：2012-02-16
申请号：US13138584
申请日：2010-03-01
申请人： Marc Joye
发明人： Marc Joye
IPC分类号： H04L9/28
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=(d−1) is expressed as a series of (/−1) non-zero digits, d*0 . . . d*1-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 =（d-1）表示为一系列（/ -1）非零数字，d * 0。。。 d * 1-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。还提供了一种装置和计算机程序产品。

48. 发明申请

US20110085659A1 Method and apparatus for generating a signature for a message and method and apparatus for verifying such a signature 有权
标题翻译：用于生成用于消息的签名的方法和装置以及用于验证这样的签名的方法和装置
公开(公告)号：US20110085659A1
公开(公告)日：2011-04-14
申请号：US12737073
申请日：2009-06-02
申请人： Marc Joye
发明人： Marc Joye
IPC分类号： H04L9/30
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）。该方法的优点在于可以不进行散列来执行。还提供了签名装置，验证装置和计算机程序支持。

49. 发明申请

US20100232599A1 Fault-resistant calculcations on elliptic curves 有权
标题翻译：椭圆曲线上的抗破坏计算
公开(公告)号：US20100232599A1
公开(公告)日：2010-09-16
申请号：US12661246
申请日：2010-03-12
申请人： Marc Joye
发明人： Marc Joye
IPC分类号： H04L9/28
CPC分类号： G06F7/725 , G06F2207/7271
摘要： Means for checking the correctness of a cryptographic operation on an elliptic curve E(Z/pZ), including fault-resistant computation of Q=kP on elliptic curve E(Z/pZ). Elliptic curve Ê(Z/pr2Z)≡E(Z/pZ)×E(Z/r2Z) is given by Chinese remaindering and where r is an integer. A point P̂=CRT(P (mod p), R (mod r2)) is formed in Ê(Z/pr2Z); P̂ reduces to P in E(Z/pZ), and to R in E1(Z/r2Z). Q̂=kP̂ in Ê(Z/pr2Z) is computed (130). It is then verified whether Q̂≡kR (mod r2) in E1(Z/r2Z), and if so, Q=Q̂ mod p is output, whereas “error” is returned if this is not the case. Also provided are an apparatus and a computer program product.
摘要翻译：用于检查椭圆曲线E（Z / pZ）上的密码操作的正确性的装置，包括椭圆曲线E（Z / pZ）上的Q = kP的耐错运算。椭圆曲线Ê（Z / pr2Z）≡E（Z / pZ）×E（Z / r2Z）由中文余数给出，其中r是整数。在Ê（Z / pr2Z）中形成点P = CRT（P（mod p），R（mod r2））; P在E（Z / pZ）中降至P，在E1（Z / r2Z）中降低到R。计算出Q（Ê（Z / pr2Z）中的kP）（130）。然后验证E1（Z / r2Z）中的Q≡kR（mod r2）是否被输出，如果是，则输出Q = Q mod p，而如果不是这种情况则返回“错误”。还提供了一种装置和计算机程序产品。

50. 发明申请

US20100208884A1 Method and device for hashing onto points of an elliptic curve 审中-公开
标题翻译：用于散列到椭圆曲线的点上的方法和装置
公开(公告)号：US20100208884A1
公开(公告)日：2010-08-19
申请号：US12658960
申请日：2010-02-18
申请人： Marc Joye
发明人： Marc Joye
IPC分类号： H04L9/28
CPC分类号： H04L9/3066
摘要： Hashing onto elements of a group, in particular onto points of an elliptic curve. An input message is run through a “regular” hashing algorithm, such as e.g. SHA-1 and MD5, and used as a scalar in multiplication with an element of the group. The result is necessarily also an element of the group. An advantage is that the security of the hashing algorithm is the same as that of the underlying “regular” hashing algorithm. Also provided is a device.
摘要翻译：对组的元素进行散列，特别是在椭圆曲线的点上。输入消息通过“常规”散列算法运行，例如， SHA-1和MD5，并且用作与组的元素相乘的标量。结果也是组的一个要素。一个优点是散列算法的安全性与底层的“常规”散列算法的安全性相同。还提供了一种设备。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式