会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 52. 发明申请
    • Methods And Apparatus For Authenticating Components Of Processing Systems
    • 用于认证加工系统部件的方法和装置
    • US20120265998A1
    • 2012-10-18
    • US13532334
    • 2012-06-25
    • Mohan J. KumarShay Gueron
    • Mohan J. KumarShay Gueron
    • G06F21/00
    • G06F21/57G06F21/575G06F2221/2129
    • When a processing system boots, it may retrieve an encrypted version of a cryptographic key from nonvolatile memory to a processing unit, which may decrypt the cryptographic key. The processing system may also retrieve a predetermined authentication code for software of the processing system, and the processing system may use the cryptographic key to compute a current authentication code for the software. The processing system may then determine whether the software should be trusted, by comparing the predetermined authentication code with the current authentication code. In various embodiments, the processing unit may use a key stored in nonvolatile storage of the processing unit to decrypt the encrypted version of the cryptographic key, a hashed message authentication code (HMAC) may be used as the authentication code, and/or the software to be authenticated may be boot firmware, a virtual machine monitor (VMM), or other software. Other embodiments are described and claimed.
    • 当处理系统引导时,它可以从非易失性存储器检索加密密钥的加密版本到处理单元,该处理单元可以解密密码密钥。 处理系统还可以检索用于处理系统的软件的预定认证码,并且处理系统可以使用密码密钥来计算软件的当前认证码。 然后,处理系统可以通过将预定认证码与当前认证码进行比较来确定软件是否应该被信任。 在各种实施例中,处理单元可以使用存储在处理单元的非易失性存储器中的密钥对加密密钥的加密版本进行解密,散列消息认证码(HMAC)可以用作认证码,和/或软件 被认证可以是启动固件,虚拟机监视器(VMM)或其他软件。 描述和要求保护其他实施例。
    • 53. 发明授权
    • Combined set bit count and detector logic
    • 组合位计数和检测器逻辑
    • US08214414B2
    • 2012-07-03
    • US12242727
    • 2008-09-30
    • Rajaraman RamanarayananSanu K. MathewRam K. KrishnamurthyShay GueronVasantha K. Erraguntla
    • Rajaraman RamanarayananSanu K. MathewRam K. KrishnamurthyShay GueronVasantha K. Erraguntla
    • G06F15/00
    • G06F7/74G06F7/607
    • A merged datapath for PopCount and BitScan is described. A hardware circuit includes a compressor tree utilized for a PopCount function, which is reused by a BitScan function (e.g., bit scan forward (BSF) or bit scan reverse (BSR)). Selector logic enables the compressor tree to operate on an input word for the PopCount or BitScan operation, based on a microprocessor instruction. The input word is encoded if a BitScan operation is selected. The compressor tree receives the input word, operates on the bits as though all bits have same level of significance (e.g., for an N-bit input word, the input word is treated as N one-bit inputs). The result of the compressor tree circuit is a binary value representing a number related to the operation performed (the number of set bits for PopCount, or the bit position of the first set bit encountered by scanning the input word).
    • 描述了PopCount和BitScan的合并数据路径。 硬件电路包括用于PopCount功能的压缩器树,其由BitScan功能(例如,位扫描前向(BSF)或位扫描反向(BSR))重用。 选择器逻辑使压缩器树能够基于微处理器指令对PopCount或BitScan操作的输入字进行操作。 如果选择了BitScan操作,则输入字被编码。 压缩器树接收输入字,对位进行操作,好像所有位具有相同的重要程度(例如,对于N位输入字,输入字被视为N个一位输入)。 压缩器树电路的结果是表示与执行的操作有关的数字的二进制值(PopCount的设置位数,或通过扫描输入字所遇到的第一组位的位位置)。
    • 55. 发明授权
    • Methods and apparatus for batch bound authentication
    • 批量绑定认证的方法和装置
    • US08068614B2
    • 2011-11-29
    • US11864887
    • 2007-09-28
    • Mohan J. KumarShay Gueron
    • Mohan J. KumarShay Gueron
    • H04L9/08G06F3/00H04L9/32
    • G06F21/572G06F21/575
    • A processing system may include a processing unit and nonvolatile storage responsive to the processing unit. The nonvolatile storage may include a candidate boot code module and an authentication code module. The processing unit may be configured to execute code from the authentication code module before executing code from the candidate boot code module. The authentication code module may have instructions which, when executed by the processing unit, cause the processing unit to read a processor identifier from the processing unit and determine whether the processor belongs to a predetermined set of processors associated with a specific vendor, based at least in part on the identifier, before executing any instructions from the candidate boot code module. The processing system may also test authenticity of the candidate boot code module before executing any instructions from the candidate boot code module. Other embodiments are described and claimed.
    • 处理系统可以包括响应于处理单元的处理单元和非易失性存储器。 非易失性存储器可以包括候选引导代码模块和认证代码模块。 处理单元可以被配置为在从候选引导代码模块执行代码之前从认证代码模块执行代码。 认证代码模块可以具有指令,当由处理单元执行时,处理单元至少从处理单元读取处理器标识符并且确定处理器是否属于与特定供应商相关联的预定处理器集合 部分地在标识符上,在执行来自候选引导代码模块的任何指令之前。 在执行来自候选引导代码模块的任何指令之前,处理系统还可以测试候选引导代码模块的真实性。 描述和要求保护其他实施例。
    • 57. 发明授权
    • Method and a system for a quick verification rabin signature scheme
    • 用于快速验证rabin签名方案的方法和系统
    • US07760873B2
    • 2010-07-20
    • US11479100
    • 2006-06-30
    • Shay GueronVinodh Gopal
    • Shay GueronVinodh Gopal
    • H04L9/30
    • H04L9/302H04L9/3249
    • A method and a system to perform a Quick Verification of a Rabin Signature (QVRS) is provided. In one embodiment, the signing party generates a Rabin signature S of an original message M using a public key N in the Rabin signature generating formula M=S2 mod N. In one embodiment, the signing party also generates a value q according to the formula q=floor(S2/N). In one embodiment, the signing party sends the original message M, the signature S, the public key N and the value q to the verifying party. In one embodiment, the verifying party verifies the integrity of the message M using the signature S, the public key N and the value q and the test equation M=S2−qN.
    • 提供了一种执行拉宾签名快速验证(QVRS)的方法和系统。 在一个实施例中,签名方使用Rabin签名生成公式M = S2 mod N中的公共密钥N来生成原始消息M的Rabin签名S.在一个实施例中,签约方还根据公式生成值q q = floor(S2 / N)。 在一个实施例中,签名方向验证方发送原始消息M,签名S,公钥N和值q。 在一个实施例中,验证方使用签名S,公钥N和值q以及测试方程M = S2-qN验证消息M的完整性。
    • 59. 发明申请
    • LIVE LOCK FREE PRIORITY SCHEME FOR MEMORY TRANSACTIONS IN TRANSACTIONAL MEMORY
    • 实时锁定用于存储器交易的优先存储器
    • US20090070774A1
    • 2009-03-12
    • US11854175
    • 2007-09-12
    • Shlomo RaikinShay GueronGad Sheaffer
    • Shlomo RaikinShay GueronGad Sheaffer
    • G06F9/46
    • G06F9/524G06F9/466
    • A method and apparatus for avoiding live-lock during transaction execution is herein described. Counting logic is utilized to track successfully committed transactions for each processing element. When a data conflict is detected between transactions on multiple processing elements, priority is provided to the processing element with the lower counting logic value. Furthermore, if the values are the same, then the processing element with the lower identification value is given priority, i.e. allowed to continue while the other transaction is aborted. To avoid live-lock between processing elements that both have predetermined counting logic values, such as maximum counting values, when one processing element reaches the predetermined counting value all counters are reset. In addition, a failure at maximum value (FMV) counter may be provided to count a number of aborts of a transaction when counting logic is at a maximum value. When the FMV counter is at a predetermined number of aborts the counting logic is reset to avoid live lock.
    • 这里描述了用于在事务执行期间避免实时锁定的方法和装置。 计数逻辑用于跟踪每个处理元素的成功提交事务。 当在多个处理元件之间的事务之间检测到数据冲突时,以较低的计数逻辑值提供给处理元件的优先级。 此外,如果值相同,则具有较低识别值的处理元件被赋予优先级,即允许在其他事务被中止时继续。 为了避免在具有预定的计数逻辑值(例如最大计数值)的处理元件之间的实时锁定,当一个处理元件达到预定计数值时,所有计数器都被重置。 此外,当计数逻辑处于最大值时,可以提供在最大值(FMV)计数器上的故障来计数事务的中止次数。 当FMV计数器处于预定数量的中止时,计数逻辑被复位以避免实时锁定。