Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial |
scientific article; zbMATH DE number 6150487
| 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; zbMATH DE number 6150487 |
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
0 references
0 references
0 references
0 references
0 references
