Efficient bit-parallel multipliers over finite fields GF\((2^m)\) (Q605724)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5819249
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient bit-parallel multipliers over finite fields GF\((2^m)\) |
scientific article; zbMATH DE number 5819249 |
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
0.8576471209526062
0 references
0.8570818901062012
0 references
0.8547247648239136
0 references
0.8520015478134155
0 references
0.8434385657310486
0 references
