Massey-Omura type adder for elements of finite fields GF(2m) in logarithmic representation

The multiplication, inversion, division and exponentiation of elements of GF(2^m) are easily implemented with conventional arithmetic and logical units when the elements are in the logarithmic representation. An electronic architecture for the addition of two elements in the logarithmic representation is presented. The architecture of the adder is similar to that of the Massey-Omura multiplier for the normal basis representation. In particular, the same combinatorial circuit is used to successively compute every bit of the sum