Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (Q2445404)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm |
scientific article |
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
