On the complexity of parallel algorithms for computing inverses in \(\text{GF}(2^m)\) with \(m\) prime (Q850789)
From MaRDI portal
scientific article
| 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 |
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
