An approximating \(k\)-ary GCD algorithm

DOI10.1134/S1995080216060147zbMath1431.94112OpenAlexW2555912531MaRDI QIDQ2361674

Sh. T. Ishmukhametov

Publication date: 30 June 2017

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080216060147

zbMATH Keywords

Farey seriesEuclidean GCD algorithm\(k\)-ary gcdWeber-Jebelean algorithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items (2)

An effective programming of GCD algorithms for natural numbers ⋮ Calculation of Bezout coefficients for a \(k\)-ary GCD algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• On practical aspects of the Miller-Rabin primality test
• Fast computation of continued fraction expansions.
• Two Fast GCD Algorithms
• The accelerated integer GCD algorithm
• The number of steps in the Euclidean algorithm

This page was built for publication: An approximating \(k\)-ary GCD algorithm