Extended GCD for polynomial over finite field: This project to calculate extended GCD for two polynomial equations over finite field GF(z). Input : two polynomials equations in format : [coefficients ...

The Extended Euclidean Algorithm (EEA) is an extension of the Euclidean Algorithm used to find the greatest common divisor (GCD) of two integers 𝑎a and 𝑏b, as well as their Bézout coefficients 𝑥x ...

Abstract: The extended Greatest Common Divisor (GCD) is an extension of the GCD operation, which computes not only the GCD of integers a and b but also the Bezout's coefficients that are integers x ...