EP2735963A1 - Galois field inversion device - Google Patents
Galois field inversion device Download PDFInfo
- Publication number
- EP2735963A1 EP2735963A1 EP12879153.0A EP12879153A EP2735963A1 EP 2735963 A1 EP2735963 A1 EP 2735963A1 EP 12879153 A EP12879153 A EP 12879153A EP 2735963 A1 EP2735963 A1 EP 2735963A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- node
- tree
- finite field
- nodes
- search tree
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/74—Selecting or encoding within a word the position of one or more bits having a specified value, e.g. most or least significant one or zero detection, priority encoders
Definitions
- the present invention relates generally to the field of an apparatus for calculating an inverse of an element in a finite field.
- a finite field is a field that contains a finite number of elements, which is widely used in various engineering fields.
- the finite field inverse operations can be roughly divided into four types: an inversion based on Fermat' s Theorem, an inversion based on Extended Euclid' s Algorithm, an inversion based on Montgomery Algorithm and an inversion based on look-up table technique.
- the object of the present invention is to provide a finite field inverter, which uses a search tree structure to calculate an inverse of an element in a finite field; the present invention is more efficient when compared with the existing finite field inverter, and it has the characteristics of high-speed, small-area and low-power consumption in inverse operation over finite field GF (2 n ) .
- the search tree inverse unit is provided with a left search tree and a right search tree.
- the left search tree and the right search tree both include tree nodes for processing inverse operations over the finite field GF (2 n ) and connecting wires 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 (2 n ) .
- 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 operand a ( x ) is represented by a path from the root node to a leaf node n 1
- the inversion result b ( x ) is represented by a path from the root node to a leaf node n 2
- the connecting wire is provided between the leaf node n 1 , and the leaf node n 2 .
- the tree nodes include a NXOR logic gate, a AND logic gate and a data selector MUX.
- One input of the NXOR logic gate is the bit value of the operand a ( x ), and the other input is i 2 .
- One input of the AND logic gate is i 0 , and the other input is the output of the NXOR logic gate.
- the data selector MUX is provided with a data input i 2 , a gated input i 3 from its child node, a inverse output o 2 and a output o 3 transmitted to its parent node.
- the present invention has the following advantages and technical effects:
- a finite field inverter of the present invention includes an input port, an output port and a search tree inverse unit.
- each tree node has, other than leaf nodes, a left child node and a right child node; the value of the left child node is 0, and the value of the right node is 1.
- Each path from the root node to a leaf node represents an element in the finite field GF (2 n ) . If an element a ( x ) in the finite field GF (2 n ) is represented by a path from the root node to a leaf node n 1 , and the inverse of a ( x ) is represented by a path from the root node to a leaf node n 2 , there will be a connecting wire connected between the leaf node n 1 , and the leaf node n 2 .
- the tree nodes of the search tree structure include three kinds of tree nodes, namely: root node, internal node and leaf node, respectively shown in Fig.3 (1), Fig.3 (2) and Fig.3 (3).
- the internal circuit of these three kinds of tree nodes are the same, each of them includes two logic gates, i.e. a NXOR logic gate and a AND logic gate, and a data selector MUX.
- o 0 ( NOT ( i 1 XOR i 2 )) AND i 0
- o 1 ( NOT ( i 1 XOR i 2 )) AND i 0 .
- the differences between the three kinds of tree nodes are input and output ports.
- the NXOR logic gate carries out logic operation on the value a n- 1 of the (n-1) th bit of a ( x ) and the other input i 2 , and then outputs the arithmetic result to one input port of the AND logic gate
- the AND logic gate carries out logical AND operation on the arithmetic result and 1, and then outputs the logical AND operation result respectively to the left child node and the right child node of the root node
- the NXOR logic gate carries out
- the AND logic gate outputs 1 to the left and right child nodes.
- the AND logic gate outputs 1 to the left and right child nodes, that means, the n 2 node is also in the correct path. It can be obtained by the same way that the n 3 node and the n 4 node are all in the correct path, so the path from n 1 to n 4 represents (0010) 2 , namely, a ( x ) .
- the output of the AND logic gate of the n 4 node is transmitted to the n 5 node. That is to say, the inverse of a ( x ) is in the finite field.
- n 4 node Because the n 4 node is connected with the n 5 node, the output value 1 of the n 4 node is transmitted to n 5 node.
- the n 5 node can directly transmit the value 1 to its parent node n 6 and its ancestor nodes n 7 and n 8 .
- n 5 node, n 6 node, n 7 node and n 8 node output the internal data (namely the input i 2 of the NXOR logic gate) to the output port, namely said internal data is b ( x ). Therefore, b ( x ) is the inverse of a ( x ) .
Abstract
Description
- The present invention relates generally to the field of an apparatus for calculating an inverse of an element in a finite field.
- A finite field is a field that contains a finite number of elements, which is widely used in various engineering fields. The finite field inverse operations can be roughly divided into four types: an inversion based on Fermat' s Theorem, an inversion based on Extended Euclid' s Algorithm, an inversion based on Montgomery Algorithm and an inversion based on look-up table technique.
- All kinds of finite field operations can be effectively applied in various cryptographic applications and coding techniques. The designing of an effective finite field inverse operation plays a key role in cryptosystem implementation. Many well-known finite field inverters in the prior art, including software inverters and hardware inverters, have some shortcomings, for example, the performance cannot reach the requirement of high-speed, small-area and low-power consumption.
- In order to overcome the deficiencies of the prior art, the object of the present invention is to provide a finite field inverter, which uses a search tree structure to calculate an inverse of an element in a finite field; the present invention is more efficient when compared with the existing finite field inverter, and it has the characteristics of high-speed, small-area and low-power consumption in inverse operation over finite field GF(2 n ).
- The object of the present invention is achieved by the following technical solutions:
- A finite field inverter includes:
- an input port, configured to input an operand a(x);
- a search tree inverse unit, configured to perform an inverse operation of an operand a(x) in the finite field GF(2 n ) based on a search tree structure; and
- an output port, configured to output an inversion result b(x) of the operand a(x).
- The search tree inverse unit is provided with a left search tree and a right search tree. The left search tree and the right search tree both include tree nodes for processing inverse operations over the finite field GF(2 n ) and connecting wires 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(2 n ). The connecting wires between the tree nodes connect the path representing the operand a(x) with the path representing the inversion result b(x).
- In the search tree inverse unit, the operand a(x) is represented by a path from the root node to a leaf node n 1, the inversion result b(x) is represented by a path from the root node to a leaf node n 2 , and the connecting wire is provided between the leaf node n 1, and the leaf node n 2 .
- In the search tree inverse unit, the tree nodes include a NXOR logic gate, a AND logic gate and a data selector MUX. One input of the NXOR logic gate is the bit value of the operand a(x), and the other input is i 2. One input of the AND logic gate is i 0, and the other input is the output of the NXOR logic gate. The data selector MUX is provided with a data input i 2 , a gated input i 3 from its child node, a inverse output o 2 and a output o 3 transmitted to its parent node. If the tree node is a root node, i 0 is 1; if the tree node is an internal node or a leaf node, and at the same time also a left child node, i 2 = 0 ; if the tree node is an internal node or a leaf node, and at the same time also a right child node, i 2 =1; if the tree node is a root node or an internal node, the AND logic gate outputs the result of Boolean AND operator to its child node; if the tree node is a leaf node, the AND logic gate outputs the result of Boolean AND operator to a leaf node connected thereto; for the root node of the left search tree, i 2 = 0 , and for the root node of the right search tree, i 2 =1.
-
- Compared with the prior art, the present invention has the following advantages and technical effects:
- The present invention achieves finite field inverse operations by a structure of search tree; compared with the existing finite field inverter, the present invention has advantages of high-speed, small-area and low-power consumption in a finite field GF(2 n ) inverse operation, and therefore, it can be applied to various engineering fields, particularly to the hardware implementation of cryptographic algorithms and to the solving of various mathematical problems.
-
-
Figure 1 is a structure schematic diagram of a finite field inverter according to an embodiment of the present invention. -
Figure 2 is a structure schematic diagram of a search tree inverse unit according to an embodiment of the present invention. -
Figure 3 is a structure schematic diagram of various tree nodes according to an embodiment of the present invention. -
Figure 4 is a structure schematic diagram of a search tree inverse unit for searching a finite field element to be inversed according to an embodiment of the present invention. -
Figure 5 is a structure schematic diagram of a search tree inverse unit for searching the inverse of a finite field element according to an embodiment of the present invention. - Further characteristics and advantages of the present invention will be apparent upon reading the following description provided by way of non-limiting examples, with reference to the attached drawings.
- As shown in
Fig.1 , a finite field inverter of the present invention includes an input port, an output port and a search tree inverse unit. - The following paragraphs will describe in detail the components of the inverter according to the present invention.
- 1. Input port: as shown in
Fig.1 , the input port of the inverter of the present invention is used for inputting a operand a(x).
a(x) can be expressed as the following form:
wherein a n-1,a n-2 ,...,a 0 are elements in GF(2). - 2. Output port: as shown in
Fig.1 , the output port of the inverter of the present invention is used for outputting an inverse b(x) of the finite field element a(x).
b(x) can be expressed as the following form:
wherein b n-1 ,b n-2 ,...,b 0 are elements in GF(2). - 3. Search tree inverse unit: as a main component of the inverter, the search tree inverse unit is a core component of the present invention, and it includes a plurality of tree nodes and connecting wires connected between the tree nodes.
- As shown in
Fig.2 , each tree node has, other than leaf nodes, a left child node and a right child node; the value of the left child node is 0, and the value of the right node is 1. Each path from the root node to a leaf node represents an element in the finite field GF(2 n ). If an element a(x) in the finite field GF(2 n ) is represented by a path from the root node to a leaf node n 1, and the inverse of a(x) is represented by a path from the root node to a leaf node n 2 , there will be a connecting wire connected between the leaf node n 1, and the leaf node n 2 . - As shown in
Fig.3 , the tree nodes of the search tree structure include three kinds of tree nodes, namely: root node, internal node and leaf node, respectively shown inFig.3 (1),Fig.3 (2) andFig.3 (3). The internal circuit of these three kinds of tree nodes are the same, each of them includes two logic gates, i.e. a NXOR logic gate and a AND logic gate, and a data selector MUX. - i 1, and i 2 are two inputs of NXOR, i 1 = ai,i 2 = 0 / 1 ; one input i 0 of AND is from an output of its parent node, and the other input of AND is from an output of NXOR ; o 1 = o 2 , o 1 and o 2 are outputs of AND, they are directly outputted to the left and right child nodes of the node. If the tree node is a left child node, the two inputs of NXOR are ai , and 0; otherwise, the two inputs of NXOR are ai , and 1. As shown in
Fig.3 , it has the following logical representation: o 0 = (NOT(i 1 XOR i 2)) AND i 0 , o 1 = (NOT(i 1 XOR i 2)) AND i 0 . - The differences between the three kinds of tree nodes are input and output ports. For example, in the root node, i 0 = 1,i 1 = a n-1 , i 2 = 0/1, wherein a n-1 is the value of the (n-1)th bit of the finite field element a(x), the NXOR logic gate carries out logic operation on the value a n-1 of the (n-1)th bit of a(x) and the other input i 2, and then outputs the arithmetic result to one input port of the AND logic gate, the AND logic gate carries out logical AND operation on the arithmetic result and 1, and then outputs the logical AND operation result respectively to the left child node and the right child node of the root node; in the internal nodes, i 1 = ai,i 2 = 0/1, wherein ai is the value of the i th bit of the finite field element a(x), the NXOR logic gate carries out logic operation on the value ai , of the i th bit of a(x) and the other input i 2, and then outputs the arithmetic result to one input port of the AND logic gate, the AND logic gate carries out logical AND operation on the arithmetic result and the output i 0 from the parent node of the internal node, and then outputs the logical AND operation result respectively to the left child node and the right child node of the internal node; in the leaf node, i 1 = a 0 ,i 2 = 0 / 1, wherein a 0 is the value of the 0th bit of the finite field element a(x), the NXOR logic gate carries out logic operation on the value a 0 of the 0th bit of a(x) and the other input i 2, and then outputs the arithmetic result to one input port of the AND logic gate, the AND logic gate carries out logical AND operation on the arithmetic result and the output i 0 from the parent node of the leaf node, and then outputs the logical AND operation result to the leaf nodes connected to the said leaf node. If the tree node is a left child node, i 2 = 0; and if the tree node is a right child node, i 2 =1. The present invention includes two search trees, that is, a left search tree and a right search tree, for the root node of the left search tree, i 2 = 0 , while for the root node of the right search tree, i 2 =1.
- The data selector MUX is defined as follows: i 2 is a data input and i 3 is a strobe input which comes from the input of the child node of the node; o 2 and o 3 are outputs, o 2 is output to the output port of the inverter that is a part of b(x), and o 3 is output to the parent node of the node. If o3=i 3 , and only if i 3=1, o 2 =i 2 , that is to say, if the output from the child node of the node is 1, the output of the inverter at the node is the input i 2 of the NXOR logic gate.
- Here is an example with n=4, by which the work process of the inverter according to the present invention is illustrated.
- Firstly, as shown in
Fig.4 , to find out which path represents the finite field element a(x) to be inversed. - Suppose the to-be-inversed element a(x)=x, which can be expressed as (0010)2 in binary. Because a n-1=n1=1, the n 1 node is in the correct path, the AND
logic gate outputs 1 to the left and right child nodes. In the n 2 node, because i 1=0,i2=0,i0=1, the ANDlogic gate outputs 1 to the left and right child nodes, that means, the n 2 node is also in the correct path. It can be obtained by the same way that the n 3 node and the n 4 node are all in the correct path, so the path from n 1 to n 4 represents (0010)2, namely, a(x). Because the n 4 node is connected with the n 5 node, the output of the AND logic gate of the n 4 node is transmitted to the n 5 node. That is to say, the inverse of a(x) is in the finite field. - Secondly, as shown in Fix.5, to find out which path represents the inverse b(x) of the finite field element a(x) to be inversed.
- Because the n 4 node is connected with the n 5 node, the
output value 1 of the n 4 node is transmitted to n 5 node. The n 5 node can directly transmit thevalue 1 to its parent node n 6 and its ancestor nodes n 7 and n 8 . Meanwhile, n 5 node, n 6 node, n 7 node and n 8 node output the internal data (namely the input i 2 of the NXOR logic gate) to the output port, namely said internal data is b(x). Therefore, b(x) is the inverse of a(x). - The above examples are preferred embodiments of the present invention, but the present invention is not limited to said embodiments; any modification, replacement, combination and simplification may be made to the embodiments without departing from the scope of the invention.
Claims (6)
- A finite field inverter, comprising:an input port, configured to input an operand a(x);a search tree inverse unit, configured to perform an inverse operation of the operand a(x) in the finite field GF(2 n ) 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 unit 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(2 n ) 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(2 n ); 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).
- The finite field inverter of claim 1, wherein in the search tree inverse unit, the operand a(x) is represented by a path from the root node to a leaf node n 1, the inversion result b(x) is represented by a path from the root node to a leaf node n 2 , and the connecting wire is provided between the leaf node n 1 and the leaf node n 2 .
- The finite field inverter of claim 1, wherein each of the root nodes and the internal nodes has a left child node and a right child node, the value of the left child node is 0, while the value of the right node is 1.
- The finite field inverter of claim 2, wherein the tree nodes of the search tree inverse unit are achieved by logic gate circuit.
- The finite field inverter of claim 4, wherein in the search tree inverse unit, the tree nodes comprises a NXOR logic gate, a AND logic gate and a data selector MUX; one input of the NXOR logic gate is the bit value of the operand a(x), and the other input of the NXOR logic gate is i 2; one input of the AND logic gate is i 0, and the other input of the AND logic gate is the output of the NXOR logic gate; the data selector MUX is provided with a data input i 2, a strobe input i 3 from its child node, an inverse output o 2 and an output o 3 transmitted to its parent node; if the tree node is a root node, i 0 is 1; if the tree node is an internal node or a leaf node, and at the same time the tree node is a left child node, i 2 = 0 ; if the tree node is an internal node or a leaf node, and at the same time the tree node is a right child node, i 2 = 1; if the tree node is a root node or an internal node, the AND logic gate outputs the result of Boolean AND operator to its child node; if the tree node is a leaf node, the AND logic gate outputs the result of Boolean AND operator to a leaf node connected to said tree node; and for the root node of the left search tree, i 2 = 0 , while for the root node of the right search tree, i 2 =1.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210275733.7A CN102902510B (en) | 2012-08-03 | 2012-08-03 | A kind of finite field inverter |
PCT/CN2012/085948 WO2014026451A1 (en) | 2012-08-03 | 2012-12-05 | Galois field inversion device |
Publications (3)
Publication Number | Publication Date |
---|---|
EP2735963A1 true EP2735963A1 (en) | 2014-05-28 |
EP2735963A4 EP2735963A4 (en) | 2015-04-01 |
EP2735963B1 EP2735963B1 (en) | 2019-10-23 |
Family
ID=47574759
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP12879153.0A Not-in-force EP2735963B1 (en) | 2012-08-03 | 2012-12-05 | Galois field inversion device |
Country Status (4)
Country | Link |
---|---|
US (1) | US9389835B2 (en) |
EP (1) | EP2735963B1 (en) |
CN (1) | CN102902510B (en) |
WO (1) | WO2014026451A1 (en) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN107797790B (en) * | 2017-11-03 | 2021-07-09 | 深圳职业技术学院 | Finite field inverter based on all-one irreducible polynomial |
CN107885486B (en) * | 2017-12-04 | 2021-09-07 | 深圳职业技术学院 | Composite finite field inversion device based on search tree |
CN108874367B (en) * | 2018-06-29 | 2022-05-13 | 深圳职业技术学院 | Compound finite field inverter based on power operation and inversion method thereof |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4975867A (en) | 1987-06-26 | 1990-12-04 | Digital Equipment Corporation | Apparatus for dividing elements of a Galois Field GF (2QM) |
KR100304193B1 (en) * | 1998-02-06 | 2001-11-22 | 윤종용 | Inverse circuit of reed-solomon decoder |
US6862354B1 (en) * | 2000-09-29 | 2005-03-01 | Cisco Technology, Inc. | Stream cipher encryption method and apparatus that can efficiently seek to arbitrary locations in a key stream |
US6779011B2 (en) | 2001-02-28 | 2004-08-17 | Maxtor Corporation | System for performing multiplication and division in GF(22M) |
JP4328487B2 (en) * | 2002-01-28 | 2009-09-09 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Combination circuit, encryption circuit, generation method thereof, and program |
US20030219118A1 (en) * | 2002-05-23 | 2003-11-27 | Beverly Harlan T. | Optimized multiplicative inverse |
US7451310B2 (en) * | 2002-12-02 | 2008-11-11 | International Business Machines Corporation | Parallelizable authentication tree for random access storage |
CN101572602A (en) * | 2008-04-28 | 2009-11-04 | 陈婧 | Finite field inversion method based on hardware design and device thereof |
US8443028B2 (en) * | 2009-06-02 | 2013-05-14 | Exelis Inc. | Circuits and methods for performing exponentiation and inversion of finite field elements |
US8904171B2 (en) * | 2011-12-30 | 2014-12-02 | Ricoh Co., Ltd. | Secure search and retrieval |
-
2012
- 2012-08-03 CN CN201210275733.7A patent/CN102902510B/en active Active
- 2012-12-05 EP EP12879153.0A patent/EP2735963B1/en not_active Not-in-force
- 2012-12-05 US US14/236,336 patent/US9389835B2/en not_active Expired - Fee Related
- 2012-12-05 WO PCT/CN2012/085948 patent/WO2014026451A1/en active Application Filing
Non-Patent Citations (3)
Title |
---|
GUO J-H ET AL: "SYSTOLIC ARRAY IMPLEMENTATION OF EUCLID'S ALGORITHM FOR INVERSION AND DIVISION IN GF(2M)", IEEE TRANSACTIONS ON COMPUTERS, IEEE SERVICE CENTER, LOS ALAMITOS, CA, US, vol. 47, no. 10, 31 October 1998 (1998-10-31), pages 1161-1167, XP000781998, ISSN: 0018-9340, DOI: 10.1109/12.660174 * |
SARKAR P ET AL: "A Parallel Algorithm for Computing Simultaneous Inversions with Application to Elliptic Curve Scalar Multiplication", MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS. CAIRO, EGYPT, DEC. 27 - 30, 2003; [MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS], PISCATAWAY, NJ, IEEE, US, vol. 2, 27 December 2003 (2003-12-27), pages 782-785, XP010867575, DOI: 10.1109/MWSCAS.2003.1562403 ISBN: 978-0-7803-8294-7 * |
See also references of WO2014026451A1 * |
Also Published As
Publication number | Publication date |
---|---|
CN102902510A (en) | 2013-01-30 |
US20150067011A1 (en) | 2015-03-05 |
WO2014026451A1 (en) | 2014-02-20 |
EP2735963A4 (en) | 2015-04-01 |
EP2735963B1 (en) | 2019-10-23 |
CN102902510B (en) | 2016-04-13 |
US9389835B2 (en) | 2016-07-12 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Vergos et al. | On modulo 2^ n+ 1 adder design | |
Kudithi et al. | High-performance ECC processor architecture design for IoT security applications | |
EP2755127B1 (en) | Composite finite field multiplier | |
Gao et al. | Elliptic curve scalar multiplier design using FPGAs | |
Kudithi | An efficient hardware implementation of the elliptic curve cryptographic processor over prime field | |
Imran et al. | Hardware design and implementation of ECC based crypto processor for low-area-applications on FPGA | |
Elkhatib et al. | Highly optimized montgomery multiplier for SIKE primes on FPGA | |
CN103793199A (en) | Rapid RSA cryptography coprocessor capable of supporting dual domains | |
Yalçin | Compact ECDSA engine for IoT applications | |
EP2735963A1 (en) | Galois field inversion device | |
US20200394017A1 (en) | Fast binary counters based on symmetric stacking and methods for same | |
Thaler | A note on the GKR protocol | |
US8650239B2 (en) | Hardware implementation of a Galois field multiplier | |
Guckert et al. | Optimized memristor-based ripple carry adders | |
Courtois et al. | Exact logic minimization and multiplicative complexity of concrete algebraic and cryptographic circuits | |
Beuchat et al. | Automatic generation of modular multipliers for FPGA applications | |
Shparlinski et al. | On the distribution of Atkin and Elkies primes | |
Rashidi et al. | Full‐custom hardware implementation of point multiplication on binary edwards curves for application‐specific integrated circuit elliptic curve cryptosystem applications | |
McIvor et al. | An FPGA elliptic curve cryptographic accelerator over GF (p) | |
Sghaier et al. | Fast Constant-Time Modular Inversion over F p Resistant to Simple Power Analysis Attacks for IoT Applications | |
Gövem et al. | A fast and compact FPGA implementation of elliptic curve cryptography using lambda coordinates | |
Li et al. | Low-complexity versatile finite field multiplier in normal basis | |
Lin et al. | An efficient algorithm for computing modular division over GF (2 m) in elliptic curve cryptography | |
Solmaz | Flexible hardware design for elliptic curve method of integer factorization | |
Neves et al. | Engineering nonlinear pseudorandom number generators |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20131226 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
RA4 | Supplementary search report drawn up and despatched (corrected) |
Effective date: 20150303 |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: G06F 7/72 20060101AFI20150225BHEP |
|
DAX | Request for extension of the european patent (deleted) | ||
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
17Q | First examination report despatched |
Effective date: 20171113 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: GRANT OF PATENT IS INTENDED |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: G06F 7/74 20060101ALI20190515BHEP Ipc: G06F 7/72 20060101AFI20190515BHEP Ipc: G06F 7/00 20060101ALI20190515BHEP |
|
INTG | Intention to grant announced |
Effective date: 20190529 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE PATENT HAS BEEN GRANTED |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
RAP1 | Party data changed (applicant data changed or rights of an application transferred) |
Owner name: SOUTH CHINA UNIVERSITY OF TECHNOLOGY (SCUT) |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602012065172 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: REF Ref document number: 1194419 Country of ref document: AT Kind code of ref document: T Effective date: 20191115 |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20191023 |
|
REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG4D |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200124 Ref country code: LT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200123 Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200224 Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: NO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200123 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: RS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: HR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200224 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: AL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 602012065172 Country of ref document: DE |
|
PG2D | Information on lapse in contracting state deleted |
Ref country code: IS |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20200223 |
|
REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 1194419 Country of ref document: AT Kind code of ref document: T Effective date: 20191023 |
|
REG | Reference to a national code |
Ref country code: BE Ref legal event code: MM Effective date: 20191231 |
|
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: SM Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 |
|
GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20200123 |
|
26N | No opposition filed |
Effective date: 20200724 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200123 Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20191205 Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20191223 Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20200701 Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20191205 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20191231 Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20191231 Ref country code: LI Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20191231 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CY Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: HU Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO Effective date: 20121205 Ref country code: MT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: TR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: MK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20191023 |