A Binary Recursive Gcd Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

A Binary Recursive Gcd Algorithm

Abstract

The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common divisor of two integers by simulating a slightly modified version of the binary algorithm. The structure of the recursive algorithm is very close to the one of the well-known Knuth-Schönhage fast gcd algorithm, but the description and the proof of correctness are significantly simpler in our case. This leads to a simplification of the implementation and to better running times.
No file

Dates and versions

inria-00100175 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100175 , version 1

Cite

Damien Stehlé, Paul Zimmermann. A Binary Recursive Gcd Algorithm. 6th International Symposium on Algorithmic Number Theory - ANTS VI, 2004, Burligton, US, pp.411--425. ⟨inria-00100175⟩
178 View
0 Download

Share

Gmail Facebook X LinkedIn More