98
Views
25
CrossRef citations to date
0
Altmetric
Original Articles

Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction

, &
Pages 125-136 | Published online: 03 Apr 2012
 

Abstract

Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recentresults have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers X1, …, Xm for the equation s = gcd (S1, …, sm) = X1S1 + … + XmSm, where S1, …, Sm are given integers. The method generalises to produce small unimodular transformation matrices for computing the Hermite normal form of an integer matrix.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.