Galois fields GF(dm) | Academic Journals and Conferences

Analysis of multiplication algorithms in Galuis fields for the cryptographic protection of information

The mathematical basis for processing a digital signature is elliptic curves. The processing of the points of an elliptic curve is based on the operations performed in the Galois fields GF(p^m). Fields with a simple foundation are not well-studied and very interesting for research. In this paper, a comparison of the complexity of algorithms for the realization of the multiplication operation in Galois fields GF(p^m) with different bases is carried out. Conducts a comparison of the 3 most common multiplication algorithms.

Definition of the extended Galois field GF(dm) with multiplier minimal hardware complexity

The paper compares realised on modern FPGA Galois fields multipliers hardware costs to select Galois field GF(dm) with approximately the same number of elements and the lowest multiplier hardware complexity. The total increase in hardware costs depending on the increase of the basics of the field has been demonstrated. Local minimums for odd d correspond to d = 2i-1 and the global minimum for analysis based on Guild cell with realization like single unit corresponds to the value d = 3 and based on Guild cell with its multiplier and adder separate realization – the value d=7.