An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation (Q834951): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4536202 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4364562 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast algorithm for computing multiplicative inverses in \(\text{GF}(2^ m)\) using normal bases / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Effective recursive algorithm for computing multiplicative inverses in GF(2m) / rank | |||
Normal rank | |||
Revision as of 21:39, 1 July 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
0 references
