Arithmetic operations in \(GF(2^ m)\) (Q1207693): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An implementation for a fast public-key cryptosystem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: New directions in cryptography / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Primitive Normal Bases for Finite Fields / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a Special Class of Polynomials / rank | |||
Normal rank | |||
Revision as of 14:59, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Arithmetic operations in \(GF(2^ m)\) |
scientific article |
Statements
Arithmetic operations in \(GF(2^ m)\) (English)
0 references
16 May 1993
0 references
The paper is concerned with the efficient computation of multiplicative inverses and of exponentiations in \(GF(2^ m)\) by exploiting a normal basis representation of the field. The method used for exponentiation is suited to parallel computation.
0 references
efficient computation of multiplicative inverses
0 references
exponentiations
0 references
normal basis
0 references
parallel computation
0 references
