A way to compute a greatest common divisor in the Galois field (GF (2^n ))
Waleed Eltayeb Ahmed · JOURNAL OF ADVANCES IN MATHEMATICS · 2019
This paper presents how the steps that used to determine a multiplicative inverse by method based on the Euclidean algorithm, can be used to find a greatest common divisor for polynomials in the Galois field (2^n ).