A Binary Recursive Gcd Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2002

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.
Fichier principal
Vignette du fichier
RR-5050.pdf (308.26 Ko) Télécharger le fichier

Dates and versions

inria-00071533 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071533 , version 1

Cite

Damien Stehlé, Paul Zimmermann. A Binary Recursive Gcd Algorithm. [Research Report] RR-5050, INRIA. 2002. ⟨inria-00071533⟩
302 View
4920 Download

Share

Gmail Mastodon Facebook X LinkedIn More