Arithmetic operations in GF(2^ m)
From MaRDI portal
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.
Recommendations
- Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
- An efficient algorithm for computing inverses in \(\text{GF}(2^{m})\) using dual bases
- scientific article; zbMATH DE number 4078798
- scientific article; zbMATH DE number 39192
- scientific article; zbMATH DE number 24470
Cites work
Cited in
(11)- Processor-efficient exponentiation in finite fields
- On primitive and free roots in a finite field
- Elliptic curve cryptosystems and their implementation
- An implementation for a fast public-key cryptosystem
- scientific article; zbMATH DE number 1618060 (Why is no real title available?)
- Algorithm for squaring in GF(2m) in standard basis
- Efficient computing of some vector operations over \(\mathrm{GF}(3)\) and \(\mathrm{GF}(4)\)
- Complexity of computation in finite fields
- Primitive Normal Polynomials Over Finite Fields
- Efficient parallel exponentiation in using normal basis representations
- Guest editorial: Special issue in honor of Scott A. Vanstone
This page was built for publication: Arithmetic operations in \(GF(2^ m)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207693)
