会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 25. 发明申请
    • Configurable Exponent Fifo
    • 可配置指数
    • US20080147768A1
    • 2008-06-19
    • US11610841
    • 2006-12-14
    • Vinodh GopalWajdi FeghaliGilbert WolrichDaniel CutterRobert P. Ottavi
    • Vinodh GopalWajdi FeghaliGilbert WolrichDaniel CutterRobert P. Ottavi
    • G06F7/38
    • G06F7/723
    • The present disclosure provides a system and method for performing modular exponentiation. The method includes loading a first word of a vector from memory into a first register and subsequently loading the first word from the first register to a second register. The method may also include loading a second word into the first register and loading at least one bit from the second register into an arithmetic logic unit. The method may further include performing modular exponentiation on the at least one bit to generate a result and generating a public key based upon, at least in part, the result. Of course, many alternatives, variations and modifications are possible without departing from this embodiment.
    • 本公开提供了一种用于执行模幂运算的系统和方法。 该方法包括将来自存储器的向量的第一字加载到第一寄存器中,并随后将第一个字从第一寄存器加载到第二寄存器。 该方法还可以包括将第二字加载到第一寄存器中并将至少一个比特从第二寄存器加载到算术逻辑单元中。 该方法还可以包括在至少一个比特上执行模幂运算以产生结果,并且至少部分地基于结果生成公开密钥。 当然,在不脱离本实施例的情况下,可以进行许多替代,变化和修改。
    • 27. 发明授权
    • High-performance hashing system
    • 高性能散列系统
    • US07373514B2
    • 2008-05-13
    • US10624533
    • 2003-07-23
    • Jon H. KruegerWajdi K. FeghaliGilbert Wolrich
    • Jon H. KruegerWajdi K. FeghaliGilbert Wolrich
    • H04L9/00
    • G06F17/30949G06F17/10
    • A high-performance, low-latency data retrieval system is disclosed using hash functions. Given a set of input data, the data retrieval system may generate one or more index values and a signature value according to a predetermined hash function. The index values may be applied to respective data arrays to access a data unit therein. The data unit may include signatures previously developed when populating the array. If a signature from the data unit matches the signature generated from the hash function, then the associated index may be applied to a second portion of the respective data array to retrieve requested data.
    • 公开了使用散列函数的高性能,低延迟数据检索系统。 给定一组输入数据,数据检索系统可以根据预定的散列函数生成一个或多个索引值和签名值。 可以将索引值应用于相应的数据阵列以访问其中的数据单元。 数据单元可以包括当填充阵列时先前开发的签名。 如果来自数据单元的签名与从哈希函数产生的签名相匹配,则相关联的索引可以被应用于相应数据阵列的第二部分以检索所请求的数据。
    • 28. 发明申请
    • APPARATUS AND METHOD FOR EFFICIENTLY EXECUTING BOOLEAN FUNCTIONS
    • 有效执行布尔函数的装置和方法
    • US20140095845A1
    • 2014-04-03
    • US13631807
    • 2012-09-28
    • Vinodh GopalWajdi FeghaliGilbert WolrichKirk Yap
    • Vinodh GopalWajdi FeghaliGilbert WolrichKirk Yap
    • G06F9/30
    • An apparatus and method are described for performing efficient Boolean operations in a pipelined processor which, in one embodiment, does not natively support three operand instructions. For example, a processor according to one embodiment of the invention comprises: a set of registers for storing packed operands; Boolean operation logic to execute a single instruction which uses three or more source operands packed in the set of registers, the Boolean operation logic to read at least three source operands and an immediate value to perform a Boolean operation on the three source operands, wherein the Boolean operation comprises: combining a bit read from each of the three operands to form an index to the immediate value, the index identifying a bit position within the immediate value; reading the bit from the identified bit position of the immediate value; and storing the bit from the identified bit position of the immediate value in a destination register.
    • 描述了一种用于在流水线处理器中执行有效的布尔运算的装置和方法,其在一个实施例中不本地支持三个操作数指令。 例如,根据本发明的一个实施例的处理器包括:一组用于存储打包操作数的寄存器; 用于执行单个指令的布尔运算逻辑,其使用打包在该组寄存器中的三个或更多个源操作数,布尔运算逻辑读取至少三个源操作数,并且立即值对三个源操作数执行布尔运算,其中, 布尔操作包括:组合从三个操作数中的每一个读取的位以形成立即值的索引,该索引标识立即值内的位位置; 从识别的位置读取该位从立即值; 并将来自所识别的立即值的比特位置的比特存储在目的地寄存器中。
    • 29. 发明申请
    • RESIDUE GENERATION
    • 残留生成
    • US20100153829A1
    • 2010-06-17
    • US12336029
    • 2008-12-16
    • Vinodh GopalErdinc OzturkGilbert WolrichWajdi Feghali
    • Vinodh GopalErdinc OzturkGilbert WolrichWajdi Feghali
    • H03M13/09G06F7/72G06F11/10
    • G06F7/724H03M13/091
    • In one embodiment, circuitry is provided to generate a residue based at least in part upon operations and a data stream generated based at least in part upon a packet. The operations may include at least one iteration of at least one reduction operation including (a) multiplying a first value with at least one portion of the data stream, and (b) producing a reduction by adding at least one other portion of the data stream to a result of the multiplying. The operations may include at least one other reduction operation including (c) producing another result by multiplying with a second value at least one portion of another stream based at least in part upon the reduction, (d) producing a third value by adding at least one other portion of the another stream to the another result, and (e) producing the residue by performing a Barrett reduction based at least in part upon the third value.
    • 在一个实施例中,提供电路以至少部分地基于至少部分地基于分组产生的操作和数据流来生成残差。 操作可以包括至少一个缩减操作的迭代,包括(a)将第一值与数据流的至少一部分相乘,以及(b)通过添加数据流的至少一个其他部分来产生减少 是乘法的结果。 所述操作可以包括至少一个其它减少操作,其包括(c)至少部分地基于所述减少,通过与另一个流的至少一部分乘以第二值来产生另一结果,(d)通过至少加入来产生第三值 另一个流的另一部分到另一个结果,以及(e)至少部分地基于第三个值执行巴雷特还原来产生残留物。