## 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*with different bases is carried out. Conducts a comparison of the 3 most common multiplication algorithms.

^{m})