The Accelerated Euclidean Algorithm
  We present a new GCD algorithm of two integers or polynomials. The algorithm is iterative and its time complexity is still $O(n \\log^2 n ~ log \\log n)$ for $n$-bit inputs. 
Sidi Mohamed Sedjelmaci (LIPN)