Comparing different GCD algorithms

dc.contributor.author	Amer I.F.
dc.contributor.author	Alkhalidi A.M.
dc.contributor.author	Ishmukhametov S.T.
dc.date.accessioned	2021-02-25T20:52:41Z
dc.date.available	2021-02-25T20:52:41Z
dc.date.issued	2020
dc.identifier.issn	2005-4238
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/162558
dc.description.abstract	© 2020 SERSC. In our paper we analyze effectiveness of several algorithms of the GCD calculation for pairs of large naturals with respect to their speed, number of iterations and possibility of parallelization of the computation procedure. We involve in our investigation the classical Euclidean GCD Algorithm, the k-ary GCD Algorithm by J. Sorenson and the new Approximating k-ary GCD Algorithm, elaborated by S. Ishmukhametov. We outline main advantage sides and shortages of each considered algorithm and their application to practical tasks like computations in finite fields used by cryptographers.
dc.relation.ispartofseries	International Journal of Advanced Science and Technology
dc.subject	Approximating k-ary GCD Algorithm
dc.subject	Euclidean GCD Algorithm
dc.subject	Greatest Common Divisor
dc.subject	K-ary GCD Algorithm
dc.title	Comparing different GCD algorithms
dc.type	Article
dc.relation.ispartofseries-issue	4 Special Issue
dc.relation.ispartofseries-volume	29
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	1278
dc.source.id	SCOPUS20054238-2020-29-4-SID85083090383

Files in this item

Name: SCOPUS20054238-20 ...

Size: 44.82Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.