Kazan Federal University Digital Repository

Investigation of the k-ary GCD Algorithm for Natural Numbers

Show simple item record

dc.contributor.author Amer I.F.
dc.contributor.author Ishmukhametov S.T.
dc.date.accessioned 2021-02-25T06:55:05Z
dc.date.available 2021-02-25T06:55:05Z
dc.date.issued 2020
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/161514
dc.description.abstract © 2020 IEEE. In our paper we investigate the k-ary Algorithm for finding GCD of long natural numbers. We suggest an effective modification for the Algorithm which gives an essential acceleration for the whole procedure of finding GCD. The common task of GCD calculation plays an important role in different spheres of Number Theory and Cryptography. It has applications in arithmetic of Finite Fields and key generation for the Cryptography.
dc.subject binary algorithm
dc.subject k-ary GCD algorithm
dc.subject the greatest common divisor GCD
dc.title Investigation of the k-ary GCD Algorithm for Natural Numbers
dc.type Conference Paper
dc.collection Публикации сотрудников КФУ
dc.source.id SCOPUS-2020-SID85098916781

Files in this item

This item appears in the following Collection(s)

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

Show simple item record

Search DSpace

Advanced Search


My Account