Low complexity normal bases in \(\mathbb F_{2^n}\) (Q1418182): 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: Matrix fields over finite extensions of prime fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for exponentiation in finite fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal normal bases / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4695307 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3216750 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3136478 / rank | |||
Normal rank |
Latest revision as of 14:01, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Low complexity normal bases in \(\mathbb F_{2^n}\) |
scientific article |
Statements
Low complexity normal bases in \(\mathbb F_{2^n}\) (English)
0 references
19 January 2004
0 references
Normal elements
0 references
Optimal normal bases
0 references
Multiplication tables
0 references