Lehmer's GCD algorithm

Known as: Lehmer, Lehmer GCD algorithm, Lehmer's algorithm 
Lehmer's GCD algorithm, named after Derrick Henry Lehmer, is a fast GCD algorithm, an improvement on the simpler but slower Euclidean algorithm. It… (More)
Wikipedia

Related topics

Related topics

2 relations
AlgorithmEuclidean algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Reviewing and Analyzing Efficient GCD/LCM Algorithms for Cryptographic Design
In this paper, we provide a practical review with numerical example and complexity analysis for greatest common divisor (GCD) and… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 4
  • table 2
Is this relevant?
2015
2015
Lehmer's GCD algorithm
In this thesis we briefly look at the rules related to the greatest common divisor and the lowest common multiple of two integers… (More)
Is this relevant?
1998
1998
A Greatest Common Divisor Algorithm
Algorithms of computation of the Greatest Common Divisor (GCD) of two integers play a principal role in all computational systems… (More)
Is this relevant?
1989
1989
ACM forum
on random number generators in the Octo-ber 1988 issue (" Random Number Generators: Good Ones are Hard to Find, " pp. 1192-1201… (More)
Is this relevant?