On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime (Q850789)
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: On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime |
scientific article; zbMATH DE number 5070967
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime |
scientific article; zbMATH DE number 5070967 |
Statements
On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime (English)
0 references
6 November 2006
0 references
