Skip to main content
Conference Proceedings

A new algorithm and refined bounds for extended gcd computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1122 145-150
DOI: 10.1007/3-540-61581-4_50
7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

Cite

CITATION STYLE

APA

Ford, D., & Havas, G. (1996). A new algorithm and refined bounds for extended gcd computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1122, pp. 145–150). Springer Verlag. https://doi.org/10.1007/3-540-61581-4_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free