Computing the modular inverses is as simple as computing the GCDs

AbstractIn 1997, Calvez, Azou, and Vilbé proposed a variation on Euclidean algorithm, which can calculate the greatest common divisors (GCDs) and inverses for polynomials. Inspired by their work, we propose a variation on the Euclidean algorithm, which uses only simple modulo operators, to compute the modular inverses. This variant only modifies the initial values and the termination condition of the Euclidean algorithm. Therefore, computing the modular inverses is as simple as computing the GCDs