Low complexity normal bases for \(F_{2^{mn}}\) (Q918710): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Low complexity normal bases / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Structure of parallel multipliers for a class of fields \(GF(2^ m)\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal normal bases in \(GF(p^ n)\) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: VLSI Architectures for Computing Multiplications and Inverses in GF(2<sup>m</sup>) / rank | |||
Normal rank | |||
Revision as of 09:23, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Low complexity normal bases for \(F_{2^{mn}}\) |
scientific article |
Statements
Low complexity normal bases for \(F_{2^{mn}}\) (English)
0 references
1990
0 references
complexity of a normal basis
0 references
Massey-Omura multiplier for \(F_{2^{mn}}\)
0 references
