Compute the remainder r of a divided by b. If r is equal to 0, then the GCD of a and b is b. Otherwise, set a to b and b to r, and go back to step 2. The Euclidean algorithm has a time complexity of O ...

Euclidean Algorithm is an efficient algorithm for finding the greatest common divisor (GCD) of two numbers. It repeatedly computes the remainder of the larger number divided by the smaller number ...

It is well known, that the series generated by a LFSR can be synthesized by either the Berlekamp-Massey algorithm for binary linear recurring sequences or the extended Euclidean algorithm in the set ...