Skip to main content
SpringerLink
Log in

Analysis of a left-shift binary GCD algorithm

  • Conference paper
  • First Online:
Algorithmic Number Theory (ANTS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 877))

Included in the following conference series:

Abstract

We introduce a new left-shift binary algorithm, LSBGCD, for computing the greatest common divisor of two integers, and we provide an analysis of the worst-case behavior of this algorithm. The analysis depends on a theorem of Ramharter about the extremal behavior of certain continuants.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. P. Brent. Analysis of the binary Euclidean algorithm. In J. F. Traub, editor, Algorithms and Complexity: New Directions and Recent Results, pages 321–355, Academic Press, New York, 1976.

    Google Scholar 

  2. A. Dupré. Sur le nombre de divisions à effectuer pour obtenir le plus grand commun diviseur entre deux nombres entiers. J. Math. Pures Appl., 11:41–64, 1846.

    Google Scholar 

  3. G. H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers. Oxford University Press, 5th edition, 1985.

    Google Scholar 

  4. D. E. Knuth. The Art of Computer Programming. Volume 2: Seminumerical Algorithms. Addison-Wesley, 1981. 2nd edition.

    Google Scholar 

  5. G. Lamé. Note sur la limite du nombre des divisions dans la recherche du plus grand commun diviseur entre deux nombres entiers. C. R. Acad. Sci. Paris, 19:867–870, 1844.

    Google Scholar 

  6. B. Nice. Extended greatest common divisors. 1993. Manuscript.

    Google Scholar 

  7. G. Ramharter. Extremal values of continuants. Proc. Amer. Math. Soc., 89:189–201, 1983.

    Google Scholar 

  8. J. O. Shallit. On the worst case of three algorithms for computing the Jacobi symbol. J. Symbolic Comput., 10:593–610, 1990.

    Google Scholar 

  9. J. O. Shallit and J. P. Sorenson. A binary algorithm for the Jacobi symbol. ACM SIGSAM Bull., 27(1):4–11, 1993.

    Google Scholar 

  10. J. P. Sorenson. Two fast GCD algorithms. J. Algorithms, 16:110–144, 1994.

    Google Scholar 

  11. J. Stein. Computational problems associated with Racah algebra. J. Comput. Phys., 1:397–405, 1967.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Jeffrey Shallit

  2. Department of Mathematics and Computer Science, Butler University, 4600 Sunset Avenue, 46208, Indianapolis, IN, USA

    Jonathan Sorenson

Authors
  1. Jeffrey Shallit
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jonathan Sorenson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leonard M. Adleman Ming-Deh Huang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shallit, J., Sorenson, J. (1994). Analysis of a left-shift binary GCD algorithm. In: Adleman, L.M., Huang, MD. (eds) Algorithmic Number Theory. ANTS 1994. Lecture Notes in Computer Science, vol 877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58691-1_55

Download citation

  • DOI: https://doi.org/10.1007/3-540-58691-1_55

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58691-3

  • Online ISBN: 978-3-540-49044-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation