Arithmetic operations in GF(2m)
Copyright policy )Arithmetic operations in GF(2m)
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.
- Karlsruhe Institute of Technology Germany
- University of Waterloo Canada
- Hochschule für Musik Karlsruhe Germany
efficient computation of multiplicative inverses, exponentiations, normal basis, Finite fields (field-theoretic aspects), parallel computation, Structure theory for finite fields and commutative rings (number-theoretic aspects), Number-theoretic algorithms; complexity
efficient computation of multiplicative inverses, exponentiations, normal basis, Finite fields (field-theoretic aspects), parallel computation, Structure theory for finite fields and commutative rings (number-theoretic aspects), Number-theoretic algorithms; complexity
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).46 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!