Centralized key distribution protocol using the greatest common divisor method

Estimation of the Greatest Common Diviso

Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method

✍ Dimitrios Christou; Marilena Mitrouli 📂 Article 📅 2005 🏛 John Wiley and Sons ⚖ 146 KB

The computation of the Greatest Common Divisor (GCD) of a set of more than two polynomials is a non-generic problem. There are cases where iterative methods of computing the GCD of many polynomials, based on the Euclidean algorithm, fail to produce accurate results, when they are implemented in a so