A Euclidean algorithm for normal bases (Q850785): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4789443 / 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: Q3935355 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3216750 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient optimal normal basis type II multiplier / 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 |
Latest revision as of 22:45, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Euclidean algorithm for normal bases |
scientific article |
Statements
A Euclidean algorithm for normal bases (English)
0 references
6 November 2006
0 references
0 references
0 references