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

61. 发明授权

US07730356B2 Method and apparatus for testing mathematical algorithms 失效
标题翻译：用于测试数学算法的方法和装置
公开(公告)号：US07730356B2
公开(公告)日：2010-06-01
申请号：US11864896
申请日：2007-09-28
申请人： Vinodh Gopal , John Vranich , Pierre Laurent , Daniel Cutter , Wajdi K. Feghali , Andrew Milne , Erdinc Ozturk
发明人： Vinodh Gopal , John Vranich , Pierre Laurent , Daniel Cutter , Wajdi K. Feghali , Andrew Milne , Erdinc Ozturk
IPC分类号： G06F11/00
CPC分类号： G06F11/3676 , G06F7/57 , G06F7/723
摘要： A method and apparatus for testing mathematical programs where code coverage is exceedingly difficult to hit with random data test vectors (probability
摘要翻译：提供了一种用于测试数学程序的方法和装置，其中代码覆盖难以用随机数据测试向量（概率<2-64）来击打。为了能够对数学程序进行测试，数学程序中的指令被捕获。通过使用可以创建错误的任何状态/控制标志来注入错误，并在稍后通过可逆操作进行纠正，以使数学运算的结果不被注入的错误修改。

62. 发明申请

US20090089617A1 METHOD AND APPARATUS FOR TESTING MATHEMATICAL ALGORITHMS 失效
标题翻译：用于测试数学算法的方法和装置
公开(公告)号：US20090089617A1
公开(公告)日：2009-04-02
申请号：US11864896
申请日：2007-09-28
申请人： Vinodh Gopal , John Vranich , Pierre Laurent , Daniel Cutter , Wajdi K. Feghali , Andrew Milne , Erdinc Ozturk
发明人： Vinodh Gopal , John Vranich , Pierre Laurent , Daniel Cutter , Wajdi K. Feghali , Andrew Milne , Erdinc Ozturk
IPC分类号： G06F11/07
CPC分类号： G06F11/3676 , G06F7/57 , G06F7/723
摘要： A method and apparatus for testing mathematical programs where code coverage is exceedingly difficult to hit with random data test vectors (probability
摘要翻译：提供了一种用于测试数学程序的方法和装置，其中代码覆盖难以用随机数据测试向量（概率<2-64）进行命中。为了能够对数学程序进行测试，数学程序中的指令被捕获。通过使用可以创建错误的任何状态/控制标志来注入错误，并在稍后通过可逆操作进行纠正，以使数学运算的结果不被注入的错误修改。

63. 发明申请

US20090006517A1 UNIFIED INTEGER/GALOIS FIELD (2m) MULTIPLIER ARCHITECTURE FOR ELLIPTIC-CURVE CRYTPOGRAPHY 有权
标题翻译：统一整数/ GALOIS字段（2m）用于ELLIPTIC-CURVE CRYTPOGRAPHY的多用户体系结构
公开(公告)号：US20090006517A1
公开(公告)日：2009-01-01
申请号：US11772166
申请日：2007-06-30
申请人： VINODH GOPAL , Erdinc Ozturk , Gilbert Wolrich , Wajdi K. Feghali
发明人： VINODH GOPAL , Erdinc Ozturk , Gilbert Wolrich , Wajdi K. Feghali
IPC分类号： G06F17/00 , G06F7/52
CPC分类号： G06F7/72 , G06F7/5324 , G06F7/725 , G06F2207/382
摘要： A unified integer/Galois-Field 2m multiplier performs multiply operations for public-key systems such as Rivert, Shamir, Aldeman (RSA), Diffie-Hellman key exchange (DH) and Elliptic Curve Cryptosystem (ECC). The multiply operations may be performed on prime fields and different composite binary fields in independent multipliers in an interleaved fashion.
摘要翻译：统一的整数/伽罗瓦域2m乘法器为诸如Rivert，Shamir，Aldeman（RSA），Diffie-Hellman密钥交换（DH）和椭圆曲线加密系统（ECC）的公钥系统执行乘法运算。可以以交错方式在独立乘法器中的主场和不同的复合二进制字段上执行乘法运算。

64. 发明授权

US08271570B2 Unified integer/galois field (2m) multiplier architecture for elliptic-curve crytpography 有权
标题翻译：用于椭圆曲线凝固图的统一整数/伽罗瓦域（2m）乘法器结构
公开(公告)号：US08271570B2
公开(公告)日：2012-09-18
申请号：US11772166
申请日：2007-06-30
申请人： Vinodh Gopal , Erdinc Ozturk , Gilbert Wolrich , Wajdi K. Feghali
发明人： Vinodh Gopal , Erdinc Ozturk , Gilbert Wolrich , Wajdi K. Feghali
IPC分类号： G06F7/00
CPC分类号： G06F7/72 , G06F7/5324 , G06F7/725 , G06F2207/382
摘要： A unified integer/Galois-Field 2m multiplier performs multiply operations for public-key systems such as Rivert, Shamir, Aldeman (RSA), Diffie-Hellman key exchange (DH) and Elliptic Curve Cryptosystem (ECC). The multiply operations may be performed on prime fields and different composite binary fields in independent multipliers in an interleaved fashion.
摘要翻译：统一的整数/伽罗瓦域2m乘法器为诸如Rivert，Shamir，Aldeman（RSA），Diffie-Hellman密钥交换（DH）和椭圆曲线加密系统（ECC）的公钥系统执行乘法运算。可以以交错方式在独立乘法器中的主场和不同的复合二进制字段上执行乘法运算。

65. 发明申请

US20090006512A1 NORMAL-BASIS TO CANONICAL-BASIS TRANSFORMATION FOR BINARY GALOIS-FIELDS GF(2m) 有权
标题翻译：二维GALOIS-FIEL的经典基础变换的正态关系GF（2m）
公开(公告)号：US20090006512A1
公开(公告)日：2009-01-01
申请号：US11772176
申请日：2007-06-30
申请人： Erdinc Ozturk , Vinodh Gopal , Gilbert Wolrich , Wajdi K. Feghali
发明人： Erdinc Ozturk , Vinodh Gopal , Gilbert Wolrich , Wajdi K. Feghali
IPC分类号： G06F7/00 , G06F15/00
CPC分类号： G06F7/724
摘要： Basis conversion from normal form to canonical form is provided for both generic polynomials and special irreducible polynomials in the form of “all ones”, referred to as “all-ones-polynomials” (AOP). Generation and storing of large matrices is minimized by creating matrices on the fly, or by providing an alternate means of computing a result with minimal hardware extensions.
摘要翻译：为“通用多项式”（AOP）的“全部”形式的通用多项式和特殊不可约数多项式提供从正常形式到规范形式的基础转换。通过在飞行中创建矩阵，或者通过提供以最小的硬件扩展来计算结果的替代方法来最小化大矩阵的生成和存储。

66. 发明申请

US20090003594A1 MODULUS SCALING FOR ELLIPTIC-CURVE CRYPTOGRAPHY 有权
标题翻译：用于ELLIPTIC-CURVE CRYPTOGRAPHY的MODULUS SCALING
公开(公告)号：US20090003594A1
公开(公告)日：2009-01-01
申请号：US11772165
申请日：2007-06-30
申请人： Erdinc Ozturk , Vinodh Gopal , Gilbert Wolrich , Wajdi K. Feghali
发明人： Erdinc Ozturk , Vinodh Gopal , Gilbert Wolrich , Wajdi K. Feghali
IPC分类号： H04L9/30 , G06F7/72
CPC分类号： G06F7/72 , G06F5/01 , G06F7/723 , G06F7/725 , H04L9/3066
摘要： Modulus scaling applied a reduction techniques decreases time to perform modular arithmetic operations by avoiding shifting and multiplication operations. Modulus scaling may be applied to both integer and binary fields and the scaling multiplier factor is chosen based on a selected reduction technique for the modular arithmetic operation.
摘要翻译：使用缩减技术的模量缩放通过避免移位和乘法运算来减少执行模数运算的时间。可以将模量缩放应用于整数和二进制字段，并且基于用于模数运算的选定的缩减技术来选择缩放倍数因子。

67. 发明申请

US20090003593A1 UNIFIED SYSTEM ARCHITECTURE FOR ELLIPTIC-CURVE CRYTPOGRAPHY 有权
标题翻译：用于ELLIPTIC-CURVE CRYTPOGRAPHY的统一系统架构
公开(公告)号：US20090003593A1
公开(公告)日：2009-01-01
申请号：US11772163
申请日：2007-06-30
申请人： Vinodh Gopal , Erdinc Ozturk , Gilbert Wolrich , Wajdi K. Feghali
发明人： Vinodh Gopal , Erdinc Ozturk , Gilbert Wolrich , Wajdi K. Feghali
IPC分类号： H04L9/30 , G06F7/72
CPC分类号： H04L9/3066 , G06F7/5324 , G06F7/725
摘要： A system for performing public key encryption is provided. The system supports mathematical operations for a plurality of public key encryption algorithms such as Rivert, Shamir, Aldeman (RSA) and Diffie-Hellman key exchange (DH) and Elliptic Curve Cryptosystem (ECC). The system supports both prime fields and different composite binary fields.
摘要翻译：提供了一种执行公钥加密的系统。该系统支持诸如Rivert，Shamir，Aldeman（RSA）和Diffie-Hellman密钥交换（DH）和椭圆曲线加密系统（ECC）的多个公共密钥加密算法的数学运算。系统支持主域和不同的复合二进制域。

68. 发明申请

US20080148011A1 Carry/Borrow Handling 审中-公开
标题翻译：携带/借款处理
公开(公告)号：US20080148011A1
公开(公告)日：2008-06-19
申请号：US11610897
申请日：2006-12-14
申请人： Vinodh Gopal , Gilbert M. Wolrich , Gunnar Gaubatz , Daniel Cutter , Wajdi Feghali , Kaan Yuksel , Erdinc Ozturk
发明人： Vinodh Gopal , Gilbert M. Wolrich , Gunnar Gaubatz , Daniel Cutter , Wajdi Feghali , Kaan Yuksel , Erdinc Ozturk
IPC分类号： G06F9/30
CPC分类号： G06F9/3001
摘要： The present disclosure provides a system and method for performing carry/borrow handling. A method according to one embodiment may include generating a first result having a first carry or borrow from a first mathematical operation and storing the first carry or borrow and a first pointer address in a temporary register. The method may further include generating a second result having a second carry or borrow from a second mathematical operation and calling a subroutine configured to perform carry and borrow handling. The method may also include copying the first pointer address from the temporary register into a global variable. Of course, many alternatives, variations and modifications are possible without departing from this embodiment.
摘要翻译：本公开提供了用于执行进位/借用处理的系统和方法。根据一个实施例的方法可以包括从第一数学运算产生具有第一进位或借位的第一结果，并将第一进位或借位以及第一指针地址存储在临时寄存器中。该方法还可以包括从第二数学运算产生具有第二进位或借位的第二结果，并调用被配置为执行进位和借位处理的子程序。该方法还可以包括将第一指针地址从临时寄存器复制到全局变量中。当然，在不脱离本实施例的情况下，可以进行许多替代，变化和修改。

69. 发明申请

US20080144811A1 Method for Simultaneous Modular Exponentiations 有权
标题翻译：同时模块化指标的方法
公开(公告)号：US20080144811A1
公开(公告)日：2008-06-19
申请号：US11610919
申请日：2006-12-14
申请人： Vinodh Gopal , Erdinc Ozturk , Kaan Yuskel , Gunnar Gaubatz , Wajdi Feghali , Gilbert M. Wolrich
发明人： Vinodh Gopal , Erdinc Ozturk , Kaan Yuskel , Gunnar Gaubatz , Wajdi Feghali , Gilbert M. Wolrich
IPC分类号： H04L9/30
CPC分类号： G06F7/723 , H04L9/302
摘要： The present disclosure provides a method for performing modular exponentiation. The method may include generating a first remainder (xp) based on an encrypted message (X) modulo a first prime number (p) and generating a second remainder (xq) based on the encrypted message (X) modulo a second prime number (q). The method may further include generating a third remainder(v1) based on the first remainder (xp) raised to a first private key number (d1) modulo the first prime number (p) and simultaneously generating a fourth remainder (v2) based on the second remainder (xq) raised to a second private key number (d2) modulo the second prime number(q). The method may also include subtracting the fourth remainder (v2) from the third remainder (v1) to yield a result (v1−v2) and multiplying the result (v1−v2) by a constant (c) to produce a second result. The method may additionally include generating a sixth remainder (h) by taking the second result modulo the first prime number (p) and multiplying the sixth remainder (h) by the second prime number (q) to produce a third result. The method may further include adding the third result and the fourth remainder (v2) to yield a final result (Y) and generating, at least in part, a public key based on the final result (Y). Of course, many alternatives, variations and modifications are possible without departing from this embodiment.
摘要翻译：本公开提供了一种用于执行模幂运算的方法。该方法可以包括基于第一素数（p）模数的加密消息（X）生成第一余数（xp），并且基于加密消息（X）生成第二余数（xq），第二素数（q））。该方法还可以包括：基于第一余数（xp）产生第三余数（v1），所述第一余数（xp）基于所述第一余数（xp）生成第一素数（p）的第一私钥数（d1）并同时生成第四余数第二余数（xq）升至第二素数（q）的第二私钥号（d2）。该方法还可以包括从第三余数（v1）中减去第四余数（v2）以产生结果（v1-v2）并将结果（v1-v2）乘以常数（c）以产生第二结果。该方法可以另外包括通过将第二结果以第一素数（p）取模并将第六余数（h）乘以第二素数（q）产生第三结果来产生第六余数（h）。该方法还可以包括添加第三结果和第四余数（v2）以产生最终结果（Y），并且至少部分地基于最终结果（Y）生成公钥。当然，在不脱离本实施例的情况下，可以进行许多替代，变化和修改。

70. 发明申请

US20140156790A1 BITSTREAM PROCESSING USING COALESCED BUFFERS AND DELAYED MATCHING AND ENHANCED MEMORY WRITES 有权
标题翻译：使用加密缓存和延迟匹配和增强存储器写入的BITSTREAM处理
公开(公告)号：US20140156790A1
公开(公告)日：2014-06-05
申请号：US13994129
申请日：2011-12-23
申请人： Vinodh Gopal , Jim D. Guilford , Gilbert M. Wolrich , Wajdi K. Feghail , Deniz Karakoyunlu , Erdinc Ozturk , Martin Dixon , Kahraman Akdemir
发明人： Vinodh Gopal , Jim D. Guilford , Gilbert M. Wolrich , Wajdi K. Feghail , Deniz Karakoyunlu , Erdinc Ozturk , Martin Dixon , Kahraman Akdemir
IPC分类号： H04L29/06
CPC分类号： H04L65/607 , H03M7/30 , H03M7/3086 , H04L65/608 , H04L69/04 , H04L69/22 , H04W28/06
摘要： Methods and apparatus for processing bitstreams and byte streams. According to one aspect, bitstream data is compressed using coalesced string match tokens with delayed matching. A matcher is employed to perform search string match operations using a shortened maximum string length search criteria, resulting in generation of a token stream having data and literal data. A distance match operation is performed on sequentially adjacent tokens to determine if they contain the same distance data. If they do, the len values of the tokens are added through use of a coalesce buffer. Upon detection of a distance non-match, a final coalesced length of a matching string is calculated and output along with the prior matching distance as a coalesced token. Also disclosed is a scheme for writing variable-length tokens into a bitstream under which token data is input into a bit accumulator and written to memory (or cache to be subsequently written to memory) as each token is processed in a manner that eliminates branch mispredict operations associated with detecting whether the bit accumulator is full or close to full.
摘要翻译：用于处理比特流和字节流的方法和装置。根据一个方面，使用具有延迟匹配的合并字符串匹配令牌来压缩比特流数据。使用匹配器来执行搜索字符串匹配操作，使用缩短的最大字符串长度搜索条件，导致生成具有数据和文字数据的令牌流。对顺序相邻的令牌执行距离匹配操作，以确定它们是否包含相同的距离数据。如果这样做，令牌的len值通过使用合并缓冲区来添加。在检测到距离不匹配时，计算匹配串的最终合并长度，并将其与先前匹配距离一起作为合并令牌输出。还公开了一种用于将可变长度令牌写入比特流的方案，在该比特流中，令牌数据被输入到比特累加器中，并且以消除分支错误预测的方式将每个令牌进行处理，并将其写入存储器（或高速缓存以随后写入存储器）检测位累加器是满或接近满的操作。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式