Polynomial Greatest Common Divisor as a Solution of System of Linear Equations
Dmitry Aleksandrovich Dolgov · Lobachevskii Journal of Mathematics · 2018
In this article we present a new algebraic approach to the greatest common divisor (GCD) computation of two polynomials based on Bezout’s identity. This approach is based on the solution of system of linear equations. Also we introduce the dmod operation for polynomials. This operation on polynomials f , g is used to reduce the degree of the larger polynomial f in a finite field F p . This operation saves GCD ( f , g ). Also we present some ideas how to reduce spurious factors that arise at the procedure.