The Accelerated Integer GCD Algorithm

@article{Weber1995TheAI,
  title={The Accelerated Integer GCD Algorithm},
  author={Kenneth Weber},
  journal={ACM Trans. Math. Softw.},
  year={1995},
  volume={21},
  pages={111-122}
}
Since the greatest common divisor (GCD) of two integers is a basic arithmetic operation used in many mathematical software systems, new algorithms for its computation are of widespread interest. The accelerated integer GCD algorithm discussed here is based on a reduction step proposed by Sorenson (k-ary reduction), coupled with the dmod operation similar to Norton's smod. Some practical limitations of Sorenson's reduction have been eliminated. Worst-case complexity is still O(n2) for n-bit… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…