Highly Influenced

# 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} }

- Published 1995 in ACM Trans. Math. Softw.
DOI:10.1145/200979.201042

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

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-2 of 2 references

Highly Influential

Highly Influential