Programming of an approximating K-ary GCD algorithm

dc.contributor.author	Amer I.F.
dc.contributor.author	Ishmukhametov S.T.
dc.contributor.author	Alkhalidi A.M.
dc.date.accessioned	2022-02-09T20:40:21Z
dc.date.available	2022-02-09T20:40:21Z
dc.date.issued	2021
dc.identifier.issn	1742-6588
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/169611
dc.description.abstract	In our paper, we consider the procedure for effective programming of an approximating k-ary GCD algorithm of natural numbers in the C++ programming language in the Visual Studio programming environment with the installed MPIR library of long numbers. There are also some theoretical calculations that justify the application of certain solutions. The task of GCD computation has an important efficient in different applications of Number Theory and Cybersecurity.
dc.relation.ispartofseries	Journal of Physics: Conference Series
dc.title	Programming of an approximating K-ary GCD algorithm
dc.type	Conference Proceeding
dc.relation.ispartofseries-issue	1
dc.relation.ispartofseries-volume	2096
dc.collection	Публикации сотрудников КФУ
dc.source.id	SCOPUS17426588-2021-2096-1-SID85121526745

Файлы в этом документе

Имя: SCOPUS17426588-20 ...

Размер: 47.38Kb

Формат: PDF

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