An approximating k-ary GCD algorithm

DOI10.1134/S1995080216060147MaRDI QIDQ2361674zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An effective programming of GCD algorithms for natural numbers
• scientific article; zbMATH DE number 2154292
• Two Fast GCD Algorithms
• Publication:4863463
• The accelerated integer GCD algorithm

Cites work

• scientific article; zbMATH DE number 1263309 (Why is no real title available?)
• scientific article; zbMATH DE number 3032896 (Why is no real title available?)
• Fast computation of continued fraction expansions.
• On practical aspects of the Miller-Rabin primality test
• The accelerated integer GCD algorithm
• The number of steps in the Euclidean algorithm
• Two Fast GCD Algorithms

Cited in

(6)

• An effective programming of GCD algorithms for natural numbers
• An algorithm reminiscent of Euclidean-gcd for computing a function related to pinwheel scheduling
• Fast computation of GCDs
• ON THE CONSTRUCTION OF A PSE FOR GCD COMPUTATION
• A Paper-and-Pencil gcd Algorithm for Gaussian Integers
• Calculation of Bezout coefficients for a k-ary GCD algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361674)