# Analysis of Fast Versions of the Euclid Algorithm

@inproceedings{Cesaratto2007AnalysisOF,
title={Analysis of Fast Versions of the Euclid Algorithm},
author={Eda Cesaratto and Benoit Daireaux and Lo{\"i}ck Lhote and V{\'e}ronique Maume-Deschamps and Brigitte Vall{\'e}e},
booktitle={ANALCO},
year={2007}
}
• Published in ANALCO 6 January 2007
• Computer Science
There exist fast variants of the gcd algorithm which are all based on principles due to Knuth and Schonhage. On inputs of size n, these algorithms use a Divide and Conquer approach, perform FFT multiplications and stop the recursion at a depth slightly smaller than lg n. A rough estimate of the worst--case complexity of these fast versions provides the bound O(n(log n)2 log log n). However, this estimate is based on some heuristics and is not actually proven. Here, we provide a precise…
5 Citations

## Figures from this paper

Gaussian Laws for the Main Parameters of the Euclid Algorithms
• Mathematics, Computer Science
Algorithmica
• 2007
It is shown here that an asymptotic Gaussian law holds for the length of remainders at a fraction of the execution, which exhibits a deep regularity phenomenon.
Probabilistic Analyses of Lattice Reduction Algorithms
• Computer Science
The LLL Algorithm
• 2010
A mixed methodology has already proved fruitful for small dimensions p, corresponding to the variety of Euclidean algorithms and to the Gauss algorithm, since the celebrated LLL algorithm precisely involves a sequence of Gauss reduction steps on sublattices of a large lattice.
Analyses de l'algorithme de Gauss. Applications à l'analyse de l'algorithme LLL. (Analyses of the Gauss. Applications of the analysis algorithm LLL)
Cette these est dediee a l'analyse probabiliste d'algorithmes de reduction des reseaux euclidiens, ou LLL devient l'al algorithms de Gauss, car cette instance est une brique de base pour le cas n>= 3.

## References

SHOWING 1-10 OF 47 REFERENCES
Gaussian Laws for the Main Parameters of the Euclid Algorithms
• Mathematics, Computer Science
Algorithmica
• 2007
It is shown here that an asymptotic Gaussian law holds for the length of remainders at a fraction of the execution, which exhibits a deep regularity phenomenon.
Sharp Estimates for the Main Parameters of the Euclid Algorithm
• Mathematics, Computer Science
LATIN
• 2006
It is proved that the bit–complexity of the extended Euclid algorithm asymptotically follows a gaussian law, and the speed of convergence towards the normal law is exhibited.
On Schönhage's algorithm and subquadratic integer gcd computation
A new subquadratic left-to-right GCD algorithm, inspired by Schonhage's algorithm for reduction of binary quadratic forms, is described, which runs slightly faster than earlier algorithms, and is much simpler to implement.
A Binary Recursive Gcd Algorithm
• Computer Science
ANTS
• 2004
This work presents 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.
Distribuional Analyses of Euclidean Algorithms
• Mathematics
ALENEX/ANALC
• 2004
The present (dynamical) analysis in distribution relies on a novel approach based on bivariate transfer operators and builds upon recent results of Dolgopyat (1998) by providing pole-free regions for certain associated Dirichlet series.
The Lyapunov tortoise and the dyadic hare
• Computer Science
• 2005
It is proved convenient to use both a 2―adic extension and a real one of the LSB algorithm, and the framework of products of random matrices involves a constant $γ$ which is the Lyapunov exponent of the set of matrices relative to the algorithm.
A Double-Digit Lehmer-Euclid Algorithm for Finding the GCD of Long Integers
This work shows how to overcome the practical difficulties by using an enhanced condition for exiting the partial cosequence computation, and achieves an experimentally measured speed-up by a factor of 2 for operands with 100 32-bit words.
Dynamical Analysis of the Parametrized Lehmer–Euclid Algorithm
• Mathematics, Computer Science
Combinatorics, Probability and Computing
• 2004
A very precise analysis of the Lehmer–Euclid Algorithm is obtained, and the behaviour of main parameters (number of iterations, bit complexity) as a function of parameter $\alpha$ is described.
Dynamical analysis of a class of Euclidean algorithms
• B. Vallée
• Mathematics, Computer Science
Theor. Comput. Sci.
• 2003