Arithmetic operations in GF(2^ m)
From MaRDI portal
Publication:1207693
DOI10.1007/BF02620228zbMATH Open0793.11032OpenAlexW2008443281MaRDI QIDQ1207693FDOQ1207693
Authors: G. B. Agnew, Thomas Beth, Ronald C. Mullin, Scott A. Vanstone 
Publication date: 16 May 1993
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02620228
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
Finite fields (field-theoretic aspects) (12E20) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30) Number-theoretic algorithms; complexity (11Y16)
Cites Work
Cited In (11)
- Processor-efficient exponentiation in finite fields
- Efficient computing of some vector operations over \(\mathrm{GF}(3)\) and \(\mathrm{GF}(4)\)
- Title not available (Why is that?)
- Efficient parallel exponentiation in using normal basis representations
- Guest editorial: Special issue in honor of Scott A. Vanstone
- Elliptic curve cryptosystems and their implementation
- On primitive and free roots in a finite field
- An implementation for a fast public-key cryptosystem
- Complexity of computation in finite fields
- Primitive Normal Polynomials Over Finite Fields
- Algorithm for squaring in GF(2m) in standard basis
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)
