On Acceleration of the k-ary GCD Algorithm

In this paper, methods of acceleration of GCD algorithms for natural numbers based on the k-ary GCD algorithm have been studied. The k-ary algorithm was elaborated by J. Sorenson in 1990. Its main idea is to find for given numbers A, B and a parameter k, co-prime to both A and B, integers x and y sa...

Full description

Bibliographic Details

Published in:	Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki Vol. 161; no. 1; pp. 110 - 118
Main Authors:	Amer, I., Ishmukhametov, S.T.
Format:	Journal Article
Language:	English
Published:	Kazan Federal University 01.01.2019
Subjects:	binary gcd algorithm euclidian gcd algorithm greatest common divisor for natural numbers k-ary gcd algorithm
ISSN:	2541-7746, 2500-2198
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!