An extended Jebelean-Weber-Sedjelmaci GCD algorithm

DOI10.22405/2226-8383-2018-19-2-421-431MaRDI QIDQ5109663zbMATH OpenOpenAlexFDO

Authors Dmitry A. Dolgov

Publication date 13 May 2020

Published in Chebyshevskii sbornik (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/cheb664

zbMATH Keywords

\(k\)-ary GCDbinary GCDEuclidean GCDGCDLehmer GCDSchönhage GCDWeber GCD

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Jebelean-Weber's algorithm without spurious factors
• The accelerated integer GCD algorithm
• scientific article; zbMATH DE number 3995051
• A parallel extended GCD algorithm
• Algorithmic Number Theory

Cites work

• Algorithmic Number Theory
• Calculation of Bezout coefficients for a k-ary GCD algorithm
• Computational problems associated with Racah algebra
• Euclid's Algorithm for Large Numbers
• Fast computation of continued fraction expansions.
• GCD calculation in the search task of pseudoprime and strong pseudoprime numbers
• scientific article; zbMATH DE number 1186932 (Why is no real title available?)
• scientific article; zbMATH DE number 1254258 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Jebelean-Weber's algorithm without spurious factors
• MDS codes in Doob graphs
• Polynomial greatest common divisor as a solution of system of linear equations
• Remark on balanced incomplete block designs, near-resolvable block designs, and \(q\)-ary constant-weight codes
• The accelerated integer GCD algorithm
• Two Fast GCD Algorithms

Cited in

(7)

• Worst-case analysis of Weber's GCD algorithm
• scientific article; zbMATH DE number 1156678 (Why is no real title available?)
• scientific article; zbMATH DE number 3995051 (Why is no real title available?)
• An alternative approach to the greatest common divisor and the Bézout's coefficients
• The extended Euclidean algorithm provides optimal Bézout numbers
• On the continued fraction with rational partial quotients
• Calculation of Bezout coefficients for a k-ary GCD algorithm

This page was built for publication: An extended Jebelean-Weber-Sedjelmaci GCD algorithm

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