Galois field

In this work Binary Galois field GF(2m) elements multipliers structural complexity  and its components decreasing has investigated. Elements of fields are represented in the normal basis of type 2. The degree of the field is less then 998.

Multipliers for binary Galois field GF (2n) hardware complexity allows to implement in FPGA an operational device with multiple multipliers. But because of large structural complexity for some combinations of large