会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 5. 发明授权
    • Circuit and method for fast modular multiplication
    • 快速模数乘法的电路和方法
    • US06356636B1
    • 2002-03-12
    • US09120580
    • 1998-07-22
    • Robert I. FosterJohn Michael BussRodney C. TeschJames Douglas DworkinMichael J. Torla
    • Robert I. FosterJohn Michael BussRodney C. TeschJames Douglas DworkinMichael J. Torla
    • H04L930
    • G06F7/728
    • A co-processor (44) executes a mathematical algorithm that computes modular exponentiation equations for encrypting or decrypting data. A pipelined multiplier (56) receives sixteen bit data values stored in an A/B RAM (72) and generates a partial product. The generated partial product is summed in an adder (58) with a previous partial product stored in a product RAM (64). A modulo reducer (60) causes a binary data value N to be aligned and added to the summed value when a particular data bit location of the summed value has a logic one value. An N RAM (70) stores the data value N that is added in a modulo reducer (60) to the summed value. The co-processor (44) computes the Foster-Montgomery Reduction Algorithm and reduces the value of (A*B mod N) without having to first compute the value of &mgr; as is required in the Montgomery Reduction Algorithm.
    • 协处理器(44)执行计算用于加密或解密数据的模幂等式的数学算法。 流水线乘法器(56)接收存储在A / B RAM(72)中的16位数据值,并产生部分乘积。 所产生的部分乘积在加法器(58)中与先前的部分乘积存储在乘积RAM(64)中相加。 当求和值的特定数据位位置具有逻辑1值时,模减法器(60)使二进制数据值N对齐并相加到求和值。 N RAM(70)将在模减法器(60)中添加的数据值N存储到求和值。 协处理器(44)计算福斯特蒙哥马利削减算法,并且减少(A * B mod N)的值,而不必首先按照Montgomery Reduction算法的要求计算mu的值。
    • 6. 发明授权
    • System for controlling data exchange between a host device and a processor
    • 用于控制主机设备和处理器之间的数据交换的系统
    • US06266717B1
    • 2001-07-24
    • US08997964
    • 1997-12-24
    • James Douglas DworkinMichael John TorlaAshok Vadekar
    • James Douglas DworkinMichael John TorlaAshok Vadekar
    • G06F1314
    • G06F9/30014G06F7/72G06F7/722G06F7/724G06F7/725G06F9/30036G06F2207/382
    • A system for efficiently controlling the exchange of data between a host bus (190) and an input/output (I/O) register (125) of an elliptic curve (EC) processor (120) having a much wider datapath than that of the host device (100) . A spreading/despreading pattern is determined which spans multiple bit positions of the input/output register (125). In one embodiment, a full combinational circuit (300) is provided to connect a bit position of the host bus (190) to a bit position of the input/output register (125). In another embodiment, a combinational circuit (300) and an intermediate register (410) are provided. In still another embodiment, a spreading-by shifting system (500) is provided which comprises a plurality of subfield modules (520) into which data from the host bus (190) is shifted. The spreading/despreading pattern is achieved through multiplexers (540) connected between the subfield modules (520). In yet another embodiment, a cross bar switch (600) is provided to connect any bit position of the host bus (190) to any bit position of the I/O register 125. In each embodiment, an EC control unit (123) is provided which stores information for the spreading/despreading pattern.
    • 一种用于有效控制主机总线(190)与椭圆曲线(EC)处理器(120)的输入/输出(I / O)寄存器(125)之间的数据交换的系统,其具有比 主机设备(100)。 确定跨越输入/输出寄存器(125)的多个位位置的扩展/解扩展模式。 在一个实施例中,提供全组合电路(300)以将主机总线(190)的位位置连接到输入/输出寄存器(125)的位位置。 在另一个实施例中,提供组合电路(300)和中间寄存器(410)。 在另一个实施例中,提供了扩展移位系统(500),其包括多个子场模块(520),来自主机总线(190)的数据被移动到该子场模块中。 扩展/解扩模式通过连接在子场模块(520)之间的多路复用器(540)来实现。 在另一个实施例中,提供了一种横杆开关(600),用于将主机总线(190)的任何位位置连接到I / O寄存器125的任何位位置。在每个实施例中,EC控制单元(123) 提供哪个存储用于扩展/解扩图案的信息。
    • 8. 发明授权
    • Circuit and method of modulo multiplication
    • 电路和模乘法的方法
    • US06182104B2
    • 2001-01-30
    • US09120835
    • 1998-07-22
    • Robert I. FosterJohn Michael BussRodney C. TeschJames Douglas DworkinMichael J. Torla
    • Robert I. FosterJohn Michael BussRodney C. TeschJames Douglas DworkinMichael J. Torla
    • G06F738
    • G06F7/728
    • A co-processor (44) executes a mathematical algorithm that computes modular exponentiation equations for encrypting or decrypting data. A pipelined multiplier (56) receives sixteen bit data values stored in an A/B RAM (72) and generates a partial product. The generated partial product is summed in a summer (58) with a previous partial product stored in a product RAM (64). A modulo reducer (60) causes a binary data value N to be aligned and added to the summed value when a particular data bit location of the summed value has a logic one value. An N RAM (70) stores the data value N that is added in a modulo reducer (60) to the summed value. The co-processor (44) computes the Foster-Montgomery Reduction Algorithm and reduces the value of (A*B mod N) without having to first compute the value of &mgr; as is required in the Montgomery Reduction Algorithm.
    • 协处理器(44)执行计算用于加密或解密数据的模幂等式的数学算法。 流水线乘法器(56)接收存储在A / B RAM(72)中的16位数据值,并产生部分乘积。 生成的部分乘积在夏季(58)中与先前的部分积存在产品RAM(64)中相加。 当求和值的特定数据位位置具有逻辑1值时,模减法器(60)使二进制数据值N对齐并相加到求和值。 N RAM(70)将在模减法器(60)中添加的数据值N存储到求和值。 协处理器(44)计算福斯特蒙哥马利削减算法,并且减少(A * B mod N)的值,而不必首先按照Montgomery Reduction算法的要求计算mu的值。
    • 9. 发明授权
    • Finite field inverse circuit
    • 有限域反向电路
    • US6009450A
    • 1999-12-28
    • US997943
    • 1997-12-24
    • James Douglas DworkinP. Michael GlaserMichael John TorlaAshok VadekarRobert John LambertScott Alexander Vanstone
    • James Douglas DworkinP. Michael GlaserMichael John TorlaAshok VadekarRobert John LambertScott Alexander Vanstone
    • G06F7/72G06F7/00
    • G06F7/726
    • A finite field inverse circuit has a finite field data unit (1112) and an inverse control unit (1110). The inverse control unit includes (1110) a k.sub.l and k.sub.u decrementer pair (1108, 1122), a k.sub.l -k.sub.u difference unit (1106), an inverse control finite state machine (1102), and a one-bit memory (1104) coupled to the inverse control finite state machine (1102). The finite field data unit (1112) includes four m bit wide registers that are shift registers designated as B (1120), A (1118), M (1114), and C (1116), where B- is a first register, A- is a second register, M- is a irreducible polynomial register, and C- is a field element register. An the irreducible polynomial is loaded left justified in the M-register, a field element to be inverted is loaded left justified in the C-register, and a single "1" is loaded in an LSB bit of the B-register. The field element is then inverted in 2n+2 system clock cycles where n is a field size associated with the field element.
    • 有限域逆电路具有有限场数据单元(1112)和逆控制单元(1110)。 逆控制单元包括(1110)kl和ku减量器对(1108,1122),kl-ku差分单元(1106),逆控制有限状态机(1102)和耦合到一个比特存储器(1104)的一位存储器 到反向有限状态机(1102)。 有限域数据单元(1112)包括四个m位宽的寄存器,它们是指定为B(1120),A(1118),M(1114)和C(1116)的移位寄存器,其中B-是第一寄存器,A - 是第二寄存器,M-是不可约多项式寄存器,C是场元素寄存器。 在M寄存器中左对齐加载不可约多项式,在C寄存器中左对齐加载要反相的场元素,并在B寄存器的LSB位中加载单个“1”。 然后,在2n + 2个系统时钟周期中,场元素被反转,其中n是与场元素相关联的场大小。
    • 10. 发明授权
    • Galois field arithmetic logic unit circuit
    • 伽罗瓦域算术逻辑单元电路
    • US6003057A
    • 1999-12-14
    • US998376
    • 1997-12-24
    • James Douglas DworkinMichael John TorlaRodney Clair TeschScott Vanstone
    • James Douglas DworkinMichael John TorlaRodney Clair TeschScott Vanstone
    • G06F7/72G06F7/00
    • G06F7/724
    • A Galois Field arithmetic logic unit (GF ALU) circuit (200) that generates a GF product of size M includes a first and a second input field element register (205, 210), a result field element register (215), a plurality, I, of subfield sets of logic gates (255, 260, 265), a plurality, S, of extension sets of logic gates (270, 275), and 3M switches (135). M is equal to S multiplied by I. A Galois Field of size M, S, and I each has an optimal normal basis. The first and second input field element registers (205, 210) are alternately coupled to the result field element register (215) by the I subfield sets of logic gates (255, 260, 265) in a first configuration and by the S extension sets of logic gates (270, 275) in a second configuration. The 3M switches (135) alternate the first and second configurations.
    • 产生尺寸M的GF乘积的伽罗瓦域算术逻辑单元(GF ALU)电路(200)包括第一和第二输入场单元寄存器(205,210),结果场单元寄存器(215),多个, I,逻辑门(255,260,265)的子场集合,多个逻辑门(270,275)的扩展组S和3M开关(135)。 M等于S乘以I.尺寸M,S和I的伽罗瓦域各具有最佳的正常基础。 第一和第二输入场元件寄存器(205,210)通过第一配置的逻辑门(255,260,265)的I子场集合和S扩展集合交替地耦合到结果场元素寄存器(215) 的第二配置中的逻辑门(270,275)。 3M开关(135)交替第一和第二配置。