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

91. 发明申请

US20150067441A1 COMPUTING DEVICE STORING LOOK-UP TABLES FOR COMPUTATION OF A FUNCTION 有权
标题翻译：用于计算功能的计算设备存储查找表
公开(公告)号：US20150067441A1
公开(公告)日：2015-03-05
申请号：US14396971
申请日：2013-10-21
申请人： KONINKLIJKE PHILIPS N.V.
发明人： Paulus Mathias hubertus Mechtildis Antonius Gorissen , Ludovicus Marinus Gerardus Maria Tolhuizer
IPC分类号： H03M13/37 , G06F9/45
CPC分类号： H03M13/37 , G06F7/544 , G06F8/41 , G06F2207/7219 , H04L9/003 , H04L9/004 , H04L9/0631 , H04L2209/16
摘要： A computing device is provide, configured to compute a function of one or more inputs, the device comprising a storage device storing one or more look-up tables used in the computation of said function, the look-up tables mapping input values to output values, the look-up table being constructed with respect to the first error correcting code, a second error correcting code, a first error threshold and a second error threshold, such that any two input values (112) that each differ at most a first error threshold number of bits from a same code word of the first error correcting code, are mapped to respective output values (131-38) that each differ at most a second error threshold number of bits from a same code word of the second error correcting code, wherein the first error threshold is at least 1 and at most the error correcting capability (t1) of the first error correcting code, and the second error 10 threshold is at most the error correcting capability (t2) of the second error correcting code.
摘要翻译：提供计算设备，被配置为计算一个或多个输入的功能，所述设备包括存储在所述功能的计算中使用的一个或多个查找表的存储设备，所述查找表将输入值映射到输出值，相对于第一纠错码，第二纠错码，第一错误阈值和第二错误阈值构造的查找表，使得每个最多不同于第一错误的任何两个输入值（112）将来自第一纠错码的同一码字的阈值位数映射到相应的输出值（131-38），每个输出值（131-38）从第二纠错码的相同代码字最多不同于第二错误阈值位数，其中所述第一误差阈值为所述第一纠错码的至少1且最多的纠错能力（t1），并且所述第二误差10阈值至多为所述第二误差公差的纠错能力（t2）修正代码

92. 发明申请

US20150026481A1 Computation Protected Against Spying 审中-公开
标题翻译：防止间谍的计算
公开(公告)号：US20150026481A1
公开(公告)日：2015-01-22
申请号：US14382026
申请日：2013-02-26
申请人： GIESECKE & DEVRIENT GMBH
发明人： Helmut Koglmeier
IPC分类号： H04L9/00 , G06F21/60 , H04L9/06
CPC分类号： H04L9/002 , G06F7/00 , G06F21/60 , G06F2207/7252 , H04L9/004 , H04L9/0625
摘要： The invention provides a method for executing a cryptographic computation comprising a plurality of blocks while employing secret data in a processor, said executing being protected against spying out of secret data. To achieve a computational result of the computation, there is executed a multiple computation in which the computation is executed several times, at least twice. Within the multiple computation, blocks of the several, at least two, executions of the computation are executed in interlaced order.
摘要翻译：本发明提供了一种用于在处理器中采用秘密数据的同时执行包括多个块的密码计算的方法，所述执行被保护以防止秘密数据的间谍。为了实现计算的计算结果，执行多次计算，其中计算被执行多次，至少两次。在多次计算中，计算的几个，至少两个执行的块以隔行顺序执行。

93. 发明申请

US20140334621A1 Method for Complete Atomic Blocks for Elliptic Curves in Jacobian Coordinates over Prime Fields Countermeasure for Simple-Side Channel Attacks and C-Safe-Fault Attacks for Left-to-Right Algorithms 审中-公开
标题翻译：完整原子块的方法在Jacobian坐标上的椭圆曲线上用于从左到右算法的简单侧通道攻击和C安全故障攻击的对策
公开(公告)号：US20140334621A1
公开(公告)日：2014-11-13
申请号：US13892816
申请日：2013-05-13
申请人： Universidad de Santiago de Chile
发明人： Rodrigo Abarzua , Nicolas Theriault
IPC分类号： G06F7/72 , H04L9/08
CPC分类号： G06F7/725 , G06F2207/7228 , H04L9/003 , H04L9/004
摘要： The present invention describes a method which improves the safety aspects of the previously published atomic blocks. This method builds new sets of atomic blocks designed to protect against both simple side-channel attacks and C-safe fault attacks for scalar multiplication for elliptic curves over prime fields. These atomic blocks are structured with the sequence of field operations (S, N, A, A, M, A), Squaring, Negation, Addition, Addition, Multiplication, Addition. These atomic blocks are applied to various operations in Jacobian coordinates: doubling, tripling, and quintupling, as well as mixed Jacobian-affine addition for use in left-to-right scalar multiplication.
摘要翻译：本发明描述了改进先前公开的原子块的安全方面的方法。这种方法构建了新的原子块集合，旨在防止简单的侧信道攻击和C安全故障攻击，用于在主场上进行椭圆曲线的标量乘法。这些原子块用场操作序列（S，N，A，A，M，A），平方，否定，加法，加法，乘法，加法构成。这些原子块应用于雅可比坐标中的各种操作：加倍，三倍和五倍，以及用于从左到右标量乘法的混合雅可比仿射加法。

94. 发明授权

US08817977B2 Method for generating a digital signature 有权
标题翻译：用于生成数字签名的方法
公开(公告)号：US08817977B2
公开(公告)日：2014-08-26
申请号：US13235089
申请日：2011-09-16
申请人： Guido Marco Bertoni , Ruggero Susella , Andrea Palomba
发明人： Guido Marco Bertoni , Ruggero Susella , Andrea Palomba
IPC分类号： G06F21/00
CPC分类号： H04L9/004 , H04L9/3066 , H04L9/3252
摘要： A method for generating a digital signature includes calculating a first magnitude representative of the inverse of a random number raised to the power two; obtaining a first element of the digital signature by executing scalar multiplication between an established point of the elliptic curve and the random number; obtaining a second magnitude by executing modular multiplication, with modulus corresponding to the established elliptic curve's order between the first magnitude and the secret encryption key; obtaining a third magnitude by executing a modular multiplication, with modulus corresponding to the established elliptic curve's order between the random number and the secret encryption key; obtaining a first addend of a second element of the digital signature by executing a modular multiplication, with modulus corresponding to the established elliptic curve's order between the second magnitude and the third magnitude; and generating a second element of the digital signature based on the first addend.
摘要翻译：一种用于产生数字签名的方法包括：计算代表提供给权力二的随机数的倒数的第一数值; 通过在椭圆曲线的建立点和随机数之间执行标量乘积来获得数字签名的第一元素; 通过执行模乘法获得第二幅度，其中模数对应于第一幅度和秘密加密密钥之间建立的椭圆曲线的顺序; 通过执行模乘法获得第三幅度，其中模数对应于随机数和秘密加密密钥之间建立的椭圆曲线的顺序; 通过执行模乘法来获得数字签名的第二元素的第一加数，其中模数对应于在第二幅度和第三幅度之间建立的椭圆曲线的顺序; 以及基于所述第一加数来生成所述数字签名的第二元素。

95. 发明授权

US08774400B2 Method for protecting data against differntial fault analysis involved in rivest, shamir, and adleman cryptography using the chinese remainder theorem 有权
标题翻译：使用中国剩余定理来保护数据不受侵扰，舍米尔和阿德曼密码学的差异性分析的保护方法
公开(公告)号：US08774400B2
公开(公告)日：2014-07-08
申请号：US11969106
申请日：2008-01-03
申请人： Arnaud Boscher , Elena Vasilievna Trichina , Helena Handschuh
发明人： Arnaud Boscher , Elena Vasilievna Trichina , Helena Handschuh
IPC分类号： H04K1/00
CPC分类号： G06F7/723 , G06F2207/7271 , H04L9/004 , H04L9/302 , H04L2209/80
摘要： Systems and methods for effectively protecting data against differential fault analysis involved in Rivest, Shamir, and Adleman (“RSA”) cryptography using the Chinese Remainder Theorem (“CRT”) are described herein. A CRT RSA component facilitates modular exponentiation of a received message, and a verification component reconstructs the received message. An exponentiation component performs a first modular exponentiation and a second modular exponentiation of the received message. A recombination component performs a recombination step utilizing CRT computation as a function of the first and second modular exponentiations. A modular exponentiation component performs first and second public exponent derivations as a function of a private exponent. The verification component can reconstructs the received message as a function of the first and second public exponent derivations. The verification component calculates the received message utilizing Chinese Remainder Theorem computation.
摘要翻译：本文描述了使用中国剩余定理（“CRT”）在Rivest，Shamir和Adleman（“RSA”）密码学中有效保护数据的差异故障分析的系统和方法。 CRT RSA组件有助于接收消息的模幂运算，并且验证组件重建接收到的消息。求幂分量执行接收到的消息的第一模幂运算和第二模幂运算。复合组件使用CRT计算来执行复合步骤作为第一和第二模幂指数的函数。模幂分量作为私有指数的函数执行第一和第二公共指数导数。验证组件可以根据第一和第二公共指数推导重建接收到的消息。验证组件使用中国剩余定理计算计算接收到的消息。

96. 发明授权

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。还提供了一种装置和计算机程序产品。

97. 发明申请

US20130346461A1 APPARATUS FOR CALCULATING A RESULT OF A SCALAR MULTIPLICATION 有权
标题翻译：用于计算标量多项式的结果的装置
公开(公告)号：US20130346461A1
公开(公告)日：2013-12-26
申请号：US13973360
申请日：2013-08-22
申请人： Infineon Technologies AG
发明人： Wieland Fischer
IPC分类号： G06F7/57
CPC分类号： G06F7/57 , G06F7/725 , G06F2207/7223 , G06F2207/7261 , H04L9/003 , H04L9/004 , H04L9/3066 , H04L2209/046 , H04L2209/08
摘要： An apparatus for calculating a result of a scalar multiplication of a reference number with a reference point on an elliptic curve comprises a point selector and a processor. The point selector is configured to select randomly or pseudo-randomly an auxiliary point on the elliptic curve. The processor is configured to calculate the result of the scalar multiplication with a double-and-always-add process using the auxiliary point.
摘要翻译：用于计算参考号与椭圆曲线上的参考点的标量乘法的结果的装置包括点选择器和处理器。点选择器被配置为随机或伪随机选择椭圆曲线上的辅助点。处理器被配置为使用辅助点使用双重且始终添加的过程来计算标量乘法的结果。

98. 发明授权

US08601273B2 Signed manifest for run-time verification of software program identity and integrity 有权
标题翻译：用于软件程序身份和完整性的运行时验证的签名清单
公开(公告)号：US08601273B2
公开(公告)日：2013-12-03
申请号：US13118017
申请日：2011-05-27
申请人： Travis Schluessler , David Durham , George Cox , Karanvir Ken Grewal
发明人： Travis Schluessler , David Durham , George Cox , Karanvir Ken Grewal
IPC分类号： H04L9/32
CPC分类号： G06F21/54 , H04L9/004 , H04L9/3236 , H04L63/123 , H04L63/126 , H04L63/20 , H04L2209/60
摘要： A measurement engine performs active platform observation. A program includes an integrity manifest to indicate an integrity check value for a section of the program's source code. The measurement engine computes a comparison value on the program's image in memory and determines if the comparison value matches the expected integrity check value. If the values do not match, the program's image is determined to be modified, and appropriate remedial action can be triggered. The integrity manifest can include a secure signature to verify the validity of the integrity manifest.
摘要翻译：测量引擎执行主动平台观察。程序包括一个完整性清单，用于指示程序源代码的一部分的完整性检查值。测量引擎计算内存中程序映像的比较值，并确定比较值是否与预期的完整性校验值相匹配。如果值不匹配，则确定程序的图像被修改，并且可以触发适当的补救动作。完整性清单可以包括安全签名以验证完整性清单的有效性。

99. 发明授权

US08345863B2 Method of countering side-channel attacks on elliptic curve cryptosystem 有权
标题翻译：对椭圆曲线密码系统进行边信道攻击的方法
公开(公告)号：US08345863B2
公开(公告)日：2013-01-01
申请号：US12108410
申请日：2008-04-23
申请人： Yoo-Jin Baek , Ihor Vasyltsov
发明人： Yoo-Jin Baek , Ihor Vasyltsov
IPC分类号： H04L29/06
CPC分类号： G06F7/725 , G06F2207/7271 , H04L9/003 , H04L9/004 , H04L9/3066
摘要： A method of countering side-channel attacks on an elliptic curve cryptosystem (ECC) is provided. The method comprises extending a definition field of an elliptic curve of the ECC to an extension ring in a first field; generating a temporary ciphertext in the extension ring and countering attacks on the ECC; and generating a final ciphertext for the first field if a fault injection attack on the ECC is not detected. The countering of attacks on the ECC may comprise countering a power attack on the ECC. Checking if there is a fault injection attack on the ECC may be performed by determining if the temporary ciphertext satisfies a second elliptic curve equation. The fault detection algorithms takes place in a small subring of the extension ring, not in the original field, to minimize the computational overhead. The method can improve the stability of the ECC and reduce computational overhead of the ECC.
摘要翻译：提供了一种针对椭圆曲线密码系统（ECC）的侧信道攻击的方法。该方法包括将ECC的椭圆曲线的定义域扩展到第一场中的扩展环; 在扩展环中生成临时密文，并对ECC进行攻击; 并且如果未检测到对ECC的故障注入攻击，则为第一场产生最终密文。对ECC的攻击的对抗可能包括对抗ECC的电源攻击。可以通过确定临时密文是否满足第二椭圆曲线方程来检查是否存在对ECC的故障注入攻击。故障检测算法发生在扩展环的小环中，而不是在原始字段中，以最小化计算开销。该方法可以提高ECC的稳定性，减少ECC的计算开销。

100. 发明授权

US08332634B2 Cryptographic systems for encrypting input data using an address associated with the input data, error detection circuits, and methods of operating the same 有权
标题翻译：使用与输入数据相关联的地址来加密输入数据的加密系统，错误检测电路及其操作方法
公开(公告)号：US08332634B2
公开(公告)日：2012-12-11
申请号：US11785281
申请日：2007-04-16
申请人： Odile Derouet
发明人： Odile Derouet
IPC分类号： G06F21/00
CPC分类号： H04L9/004 , H04L9/0618 , H04L2209/046 , H04L2209/12
摘要： A cryptographic system includes encryption logic that is configured to encrypt input data by performing a mask operation on the input data using an address associated with the input data.
摘要翻译：加密系统包括加密逻辑，其被配置为通过使用与输入数据相关联的地址对输入数据执行掩码操作来加密输入数据。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式