.png){kind=icon}
.png){kind=icon}
Return
A Matrix Decomposition Method for Optimal Normal Basis Multiplication
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2016.2543228.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce a matrix decomposition method and prove that multiplication in GF(2(k)) with a Type 1 optimal normal basis for can be performed using k(2) - 1 XOR gates irrespective of the choice of the irreducible polynomial generating the field. The previous results achieved this bound only with special irreducible polynomials. Furthermore, the decomposition method performs the multiplication operation using 1.5k(k - 1) XOR gates for Type 2a and 2b optimal normal bases, which matches previous bounds.
Keywords:
Massey-Omura
type 1
type 2a
type 2b normal bases
gaussian normal bases
elliptic curve cryptography
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
