On degrees of modular common divisors and the Big prime gcd algorithm

Vahagn H. Mikaelian

We consider a few modifications of the Big prime modular $\gcd$ algorithm for polynomials in $\mathbb{Z}[x]$. Our modifications are based on bounds of degrees of modular common divisors of…