On acceleration of the k-ary GCD Algorithm

dc.contributor.author	Amer I.
dc.date.accessioned	2021-02-25T06:53:23Z
dc.date.available	2021-02-25T06:53:23Z
dc.date.issued	2020
dc.identifier.issn	1757-8981
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/161290
dc.description.abstract	© Published under licence by IOP Publishing Ltd. In our paper we analyze a method of acceleration of the k-ary Algorithm of finding the greatest common divisor for long natural numbers. The k-ary GCD algorithm was invented in 1990 by J. Sorenson. We show that a small modification of Sorenson's Algorithm gives a sufficient acceleration of its work. This is useful for applications using the GCD operation like calculations in finite fields, generation of Cryptography keys etc.
dc.relation.ispartofseries	IOP Conference Series: Materials Science and Engineering
dc.title	On acceleration of the k-ary GCD Algorithm
dc.type	Conference Paper
dc.relation.ispartofseries-issue	1
dc.relation.ispartofseries-volume	734
dc.collection	Публикации сотрудников КФУ
dc.source.id	SCOPUS17578981-2020-734-1-SID85079616595

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

Имя: SCOPUS17578981-20 ...

Размер: 44.25Kb

Формат: PDF

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