An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation (Q834951): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:57, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation |
scientific article |
Statements
An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation (English)
0 references
27 August 2009
0 references
algorithms
0 references
multiplicative inversion
0 references
normal basis
0 references
Fermat's theorem
0 references
