Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (Q2445404)
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: Novel bit-parallel multiplier for GF(2ᵐ) defined by all-one polynomial using generalized Karatsuba algorithm |
scientific article; zbMATH DE number 6284431
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm |
scientific article; zbMATH DE number 6284431 |
Statements
Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (English)
0 references
14 April 2014
0 references
generalized Karatsuba algorithm
0 references
bit-parallel multiplier
0 references
all-one polynomial
0 references
redundant representation
0 references
cryptography
0 references
0 references
0.8455884456634521
0 references
0.8443347811698914
0 references
0.8410393595695496
0 references
0.8382159471511841
0 references
