Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials (Q2413208): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:33, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials |
scientific article |
Statements
Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials (English)
0 references
10 April 2018
0 references
finite field
0 references
irreducible polynomial
0 references
polynomial basis
0 references
multiplication
0 references
