Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\) (Q1199646): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Bit-serial Reed - Solomon encoders / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4081121 / rank | |||
Normal rank | |||
Latest revision as of 16:20, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\) |
scientific article |
Statements
Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\) (English)
0 references
16 January 1993
0 references
A method of simplifying multiplication in \(GF(2^ m)\) is described. It can be used only for values \(m\) for which \((m+1)\) is a prime and 2 is a primitive element of \(GF(m+1)\), e.g. \(m=2,4,10,12,\dots\;\). Generalization to the nonbinary case is also discussed.
0 references
finite field
0 references
multiplication
0 references
