Analysis of the k-ary Euclid for tuples of integers

dc.contributor.author	Amer I.
dc.contributor.author	Ishmukhametov S.
dc.date.accessioned	2020-01-15T21:49:47Z
dc.date.available	2020-01-15T21:49:47Z
dc.date.issued	2019
dc.identifier.issn	1742-6588
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/156242
dc.description.abstract	© Published under licence by IOP Publishing Ltd. 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.relation.ispartofseries	Journal of Physics: Conference Series
dc.title	Analysis of the k-ary Euclid for tuples of integers
dc.type	Conference Paper
dc.relation.ispartofseries-issue	1
dc.relation.ispartofseries-volume	1352
dc.collection	Публикации сотрудников КФУ
dc.source.id	SCOPUS17426588-2019-1352-1-SID85076191292

Files in this item

Size: 44.07Kb

Format: PDF

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