| 发明名称 | Finite field inverter | ||
| 摘要 | A finite field inverter is disclosed, wherein the finite field inverter includes an input port, an output port and a search tree inverse circuit configured to perform an inverse operation of the operand a(x) in the finite field GF(2n) based on a search tree structure. The search tree inverse circuit is provided with a left search tree and a right search tree. The left search tree and the right search tree each includes tree nodes for processing inverse operations over the finite field GF(2n) and connecting wires connected between the tree nodes. The tree nodes include a root node, internal nodes and leaf nodes. Each path from the root node to a leaf node represents an element in the finite field GF(2n). The connecting wires between the tree nodes connect the path representing the operand a(x) with the path representing the inversion result b(x) . The present invention uses a search tree inverse circuit to achieve an inverse operation of an element in a finite field, and compared with the existing finite field inverter, the present invention is more efficient in processing inverse operations over the finite field GF(2n). | ||
| 申请公布号 | US9389835(B2) | 申请公布日期 | 2016.07.12 |
| 申请号 | US201214236336 | 申请日期 | 2012.12.05 |
| 申请人 | South China University of Technology | 发明人 | Tang Shaohua;Yi Haibo |
| 分类号 | G06F7/00;G06F7/72 | 主分类号 | G06F7/00 |
| 代理机构 | Coats & Bennett, P.L.L.C. | 代理人 | Coats & Bennett, P.L.L.C. |
| 主权项 | 1. A finite field inverter, comprising: an input port, configured to input an operand a(x); a search tree inverse circuit, configured to perform an inverse operation of the operand a(x) in the finite field GF(2n) based on a search tree structure; an output port, configured to output an inversion result b(x) of the operand a(x); wherein the search tree inverse circuit is provided with a left search tree and a right search tree; the left search tree and the right search tree each comprises tree nodes for processing inverse operations over the finite field GF(2n) and connecting wires connected between the tree nodes, the tree nodes comprise a root node, internal nodes and leaf nodes, each path from the root node to a leaf node represents an element in the finite field GF(2n); and the connecting wires between the tree nodes connect the path representing the operand a(x) with the path representing the inversion result b(x). | ||
| 地址 | Guangzhou, Guangdong CN | ||