IEEE Transactions on Computers · 1998 · 186 citations · 5 references
EngineeringComputer EngineeringComputer ScienceTheory Of ComputationLookup TablesArithmetic Circuit ComplexityArithmetic Of Finite FieldsFinite Field ArithmeticFinite Field ComputationMultiplier DesignMultipliers
We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2m) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m/sup 2/-1 XOR gates and m/sup 2/ AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier.
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