Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$ (Q3474890)
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: Some Observations on Parallel Algorithms for Fast Exponentiation in \operatorname{GF}(2ⁿ) |
scientific article; zbMATH DE number 4143444
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$ |
scientific article; zbMATH DE number 4143444 |
Statements
Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$ (English)
0 references
1990
0 references
finite field
0 references
exponentiation
0 references
parallel algorithm
0 references
normal basis
0 references
0.9133564
0 references
0.90392727
0 references
0.89598686
0 references
0.88900673
0 references
0.8837638
0 references
0.8828406
0 references
0.87817967
0 references
0 references
