An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\) (Q1177865): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GAP / rank | |||
Normal rank | |||
Revision as of 22:24, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\) |
scientific article |
Statements
An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\) (English)
0 references
26 June 1992
0 references
The authors present a bilinear algorithm for multiplication of two elements of \(\mathbb{F}_{256}=(\mathbb{F}_ 4)^ 4\) using eight multiplications in \(\mathbb{F}_ 4\). This number of 8 required \(\mathbb{F}_ 4\)-multiplications is minimal. This algorithm is an application of an interpolation from \textit{D. V. Chudnovsky} and \textit{G. V. Chudnovsky} [Proc. Natl. Acad. Sci. USA 84, 1739-1743 (1987; Zbl 0644.68066)] applied to a well-chosen projective curve, i.e. the Fermat curve \(x^ 3+y^ 3=1\) over \(\mathbb{F}_ 4\).
0 references
elliptic curves
0 references
bilinear complexity
0 references
interpolation algorithms
0 references
Riemann- Roch theorem
0 references
finite fields
0 references
