Efficient bit-parallel multipliers over finite fields GF\((2^m)\) (Q605724)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient bit-parallel multipliers over finite fields GF\((2^m)\) |
scientific article |
Statements
Efficient bit-parallel multipliers over finite fields GF\((2^m)\) (English)
0 references
25 November 2010
0 references
composite field
0 references
trinomial
0 references
pentanomial
0 references
like-polynomial
0 references
like-trinomial
0 references
permutation polynomial
0 references
