A Binary Recursive Gcd Algorithm

Damien Stehlé 1 Paul Zimmermann 1
1 SPACES - Solving problems through algebraic computation and efficient software
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Type de document :
Communication dans un congrès
Duncan Buell. 6th International Symposium on Algorithmic Number Theory - ANTS VI, 2004, Burligton, US, Springer, 3076, pp.411--425, 2004, Lecture notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/inria-00100175
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:15:09
Dernière modification le : jeudi 11 janvier 2018 - 06:20:00

Identifiants

  • HAL Id : inria-00100175, version 1

Collections

Citation

Damien Stehlé, Paul Zimmermann. A Binary Recursive Gcd Algorithm. Duncan Buell. 6th International Symposium on Algorithmic Number Theory - ANTS VI, 2004, Burligton, US, Springer, 3076, pp.411--425, 2004, Lecture notes in Computer Science. 〈inria-00100175〉

Partager

Métriques

Consultations de la notice

319