FPGA CORES FOR FAST MULTIPLICATIVE INVERSE CALCULATION IN GALOIS FIELDS
There are two common methods for division in a Galois Field GF(2m): based on multiplication an extended Euclidean algorithm for polynomial basis and exponentiation method for normal basis. The disadvantage of the first one is the dependence of division time on the value of operands. So in the study some undependable on operand values methods based on squares and square roots calculation are tested to select ones with the best hardware and time complexity for polynomial basis. All methods were implemented as field programmable integrated circuit (FPGA) cores, their work was verified by simulation.