High speed galois fields GF(2m) multipliers

In the paper a new GF(2^m) multiplier for standard basis representation is developed. Proposed multiplier can be designed for every field GF(2^m). Multiplier complexity and delay are analytically evaluated for many polynomial classes. Timing and area occupation performances of the proposed multiplier are compared with those of previously proposed solutions. The comparison shows that the proposed multiplier outperforms previous architectures for every considered GF(2^m) field.