The Accelerated Euclidean Algorithm
<|reference_start|>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.<|reference_end|>
@article{sedjelmaci2004the,
    title={The Accelerated Euclidean Algorithm},
    author={Sidi Mohamed Sedjelmaci (LIPN)},
    journal={Proceedings of the EACA, (2004) 283-287},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0412006},
    primaryClass={cs.DS}
}