Analysis of the k-ary Euclid for tuples of integers

dc.contributor	Казанский федеральный университет
dc.contributor.author	Ishmukhametov Shamil Talgatovich
dc.contributor.author	Amer Ismail
dc.date.accessioned	2019-11-22T11:44:54Z
dc.date.available	2019-11-22T11:44:54Z
dc.date.issued	2019
dc.identifier.citation	Ismail Amer. Analysis of the k-ary Euclid for tuples of integers / Ismail Amer, Sh. TIshmukhametov // Journal of Physics: Conf. Series. - 2019. - Vol. 1352. - P. 1-4.
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/152005
dc.description.abstract	In our paper we discuss the k-ary Euclid Algorithm for counting the great common divisor (GCD) of two or more integers and suggest some improvements. This gives us a possibility to parallelize and speed up the calculating of GCD, which has a variety of applications in the Number Theory, Modular Arithmetic and the Cryptography Algorithms such as RSA, ElGamal encryption system and others.
dc.language.iso	en
dc.relation.ispartofseries	Journal of Physics: Conf. Series
dc.rights	открытый доступ
dc.subject	greatest common divisor
dc.subject	Eucledean Algorithm
dc.subject	k-ary GCD algorithm
dc.subject.other	Математика
dc.title	Analysis of the k-ary Euclid for tuples of integers
dc.type	Article
dc.contributor.org	Институт вычислительной математики и информационных технологий
dc.description.pages	1-4
dc.relation.ispartofseries-volume	1352
dc.pub-id	214237
dc.identifier.doi	10.1088/1742-6596/1352/1/012001