GALOIS FIELDS ELEMENTS MULTISECTION MULTIPLIERS STRUCTURAL COMPLEXITY REDUCTION
Abstract
The article discusses the approach to reducing the structural complexity of multi-multipliers binary
elements of Galois fields. The hardware complexity of multipliers allows for them to Field-Programmable Gate Array,
but due to the structural complexity of combinatorial make it impossible. The paper proposes a preliminary ordering
matrix using the agitator and its implementation of the same type of logical multiplication of matrices. As a
consequence, achieved by reducing the number of matrices, reducing their hardware and structural complexity due to
multiple use.