Dual bases and bit-serial multiplication in \(\mathbb F_q^n\). (Q1575849)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dual bases and bit-serial multiplication in \(\mathbb F_q^n\). |
scientific article; zbMATH DE number 1495149
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dual bases and bit-serial multiplication in \(\mathbb F_q^n\). |
scientific article; zbMATH DE number 1495149 |
Statements
Dual bases and bit-serial multiplication in \(\mathbb F_q^n\). (English)
0 references
23 August 2000
0 references
In the paper the structure of bit-serial multiplication in \(\mathbb F_q^n\) is examined. Some bit-serial multipliers employ dual basis representations for reasons of efficiency. It has been shown that all bit-serial multipliers for \(\mathbb F_q^n\) are implicitly dual basis multipliers. This result has led to elegant and compact mathematical theory of bit-serial multipliers.
0 references
dual bases
0 references
trace function
0 references
bit-serial multiplication
0 references
linear feedback shift registers
0 references
Galois LSFR
0 references
Fibonacci LFSR
0 references
Berlekamp's multiplier
0 references
Massey-Omura multiplier
0 references
