Electronics Letters · 1988 · 24 citations · 1 references
Natural SciencesComputer EngineeringComputer ScienceAlgebraAlgorithmsTheory Of ComputationAlgebraic Number TheoryComputational AlgebraGalois TheoryArithmetic Of Finite FieldsExponentiation AlgorithmsFinite Field ArithmeticFinite Field ComputationRecursive Algorithm Design
The letter presents an effective recursive algorithm for computing multiplicative inverses in GF(2m), where m = 2k, employing normal bases. The proposed algorithm requires m − 1 cyclic shifts and two multiplications in GF(2m) and in each subfield of GF(2m): GF(2m/2), GF(2m/4), …, GF(28) and GF(24).
1
VLSI Architectures for Computing Multiplications and Inverses in GF(2<sup>m</sup>)
Wang, Troung, Shao et al. · IEEE Transactions on Computers · 1985 · 320 citations