IEEE Transactions on Computers · 2001 · 72 citations · 5 references
ComputingComputer ScienceMathematicsAlgebraAlgorithmsTheory Of ComputationAlgebraic Number TheoryMatrix ComputationNumber-theoretic AlgorithmsArithmetic Of Finite FieldsDiscrete Logarithm AlgorithmsExponentiation AlgorithmsFermat FactorizationFinite Field ArithmeticModular Arithmetic AlgorithmsModular InversionModular Inversion Algorithms
A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis is proposed. It is an improvement on those proposed by Itoh and Tsujii and by Chang et al., which are based on Fermat's theorem and require O(logm) multiplications. The number of multiplications is reduced by decomposing m-1 into several factors and a small remainder.
5
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