Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm

DOI10.3103/S1066369X17110044zbMath1412.11143OpenAlexW2766246451MaRDI QIDQ681960

Sh. T. Ishmukhametov, Kamal' Al'-Anni Maad, B. G. Mubarakov

Publication date: 13 February 2018

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x17110044

zbMATH Keywords

Euclidean algorithmextended Euclidean algorithm\(k\)-ary GCD algorithmcalculation of inverse elements by module

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16)

Related Items (2)

An extended Jebelean^ WeberNSedjelmaci GCD algorithm ⋮ An effective programming of GCD algorithms for natural numbers

Cites Work

• An approximating \(k\)-ary GCD algorithm
• Two Fast GCD Algorithms
• The accelerated integer GCD algorithm
• Acceleration of Euclidean Algorithm and Rational Number Reconstruction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm