会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 8. 发明申请
    • 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.
    • 本公开提供了一种用于执行模幂运算的系统和方法。 该方法包括将来自存储器的向量的第一字加载到第一寄存器中,并随后将第一个字从第一寄存器加载到第二寄存器。 该方法还可以包括将第二字加载到第一寄存器中并将至少一个比特从第二寄存器加载到算术逻辑单元中。 该方法还可以包括在至少一个比特上执行模幂运算以产生结果,并且至少部分地基于结果生成公开密钥。 当然,在不脱离本实施例的情况下,可以进行许多替代,变化和修改。
    • 9. 发明申请
    • Hardware Accelerator
    • 硬件加速器
    • US20080148024A1
    • 2008-06-19
    • US11610871
    • 2006-12-14
    • Gilbert M. WolrichWilliam HasenplaughWajdi FeghaliDaniel CutterVinodh GopalGunnar Gaubatz
    • Gilbert M. WolrichWilliam HasenplaughWajdi FeghaliDaniel CutterVinodh GopalGunnar Gaubatz
    • G06F9/302
    • G06F9/30014G06F21/72
    • The present disclosure provides a method for instruction processing. The method may include adding a first operand from a first register, a second operand from a second register and a carry input bit to generate a sum and a carry out bit. The method may further include loading the sum into a third register and loading the carry out bit into a most significant bit position of the third register to generate a third operand. The method may also include performing a single bit shift on the third operand via a shifter unit to produce a shifted operand and loading the shifted operand into the fourth register. The method may further include loading a least significant bit from the sum into the most significant bit position of the fourth register to generate a fourth operand. The method may additionally include generating a greatest common divisor (GCD) of the first and second operands via the fourth operand and generating a public key based on, at least in part, the GCD. Of course, many alternatives, variations and modifications are possible without departing from this embodiment.
    • 本公开提供了一种用于指令处理的方法。 该方法可以包括从第一寄存器,第二操作数,第二寄存器和进位输入位添加第一操作数,以产生和和执行位。 该方法还可以包括将和加载到第三寄存器中,并且将进位位加载到第三寄存器的最高有效位位置以产生第三操作数。 该方法还可以包括经由移位器单元在第三操作数上执行单位移位以产生移位的操作数,并将移位的操作数加载到第四寄存器中。 该方法还可以包括将最小有效位加载到第四寄存器的最高有效位位置以产生第四操作数。 该方法可以另外包括经由第四操作数生成第一和第二操作数的最大公约数(GCD),并且至少部分地基于GCD生成公钥。 当然,在不脱离本实施例的情况下,可以进行许多替代,变化和修改。
    • 10. 发明授权
    • Hardware accelerator
    • 硬件加速器
    • US08020142B2
    • 2011-09-13
    • US11610871
    • 2006-12-14
    • Gilbert M. WolrichWilliam HasenplaughWajdi FeghaliDaniel CutterVinodh GopalGunnar Gaubatz
    • Gilbert M. WolrichWilliam HasenplaughWajdi FeghaliDaniel CutterVinodh GopalGunnar Gaubatz
    • G06F9/44G06F9/45G06F7/38
    • G06F9/30014G06F21/72
    • A method for instruction processing may include adding a first operand from a first register, a second operand from a second register and a carry input bit to generate a sum and a carry out bit, loading the sum into a third register and loading the carry out bit into a most significant bit position of the third register to generate a third operand, performing a single bit shift on the third operand via a shifter unit to produce a shifted operand and loading the shifted operand into the fourth register, loading a least significant bit from the sum into the most significant bit position of the fourth register to generate a fourth operand, generating a greatest common divisor (GCD) of the first and second operands via the fourth operand and generating a public key based on, at least in part, the GCD. Many alternatives, variations and modifications are possible.
    • 一种用于指令处理的方法可以包括从第一寄存器,第二操作数,第二寄存器和进位输入位添加第一操作数,以产生和和执行位,将所述和加载到第三寄存器并加载进位 位到第三寄存器的最高有效位位置以产生第三操作数,经由移位器单元在第三操作数上执行单位移位以产生移位操作数,并将移位的操作数加载到第四寄存器中,加载最低有效位 从总和到第四寄存器的最高有效位位置以产生第四操作数,经由第四操作数产生第一和第二操作数的最大公约数(GCD),并且至少部分地基于第二操作数生成公钥, GCD。 许多替代方案,变化和修改是可能的。