Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:59, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial |
scientific article |
Statements
Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (English)
0 references
4 April 2013
0 references
multiplier
0 references
cryptography
0 references
multiplexer
0 references
finite field
0 references
polynomial basis
0 references
