dc.contributor.author |
Amer I.F. |
|
dc.contributor.author |
Saad M. |
|
dc.date.accessioned |
2021-02-25T06:52:13Z |
|
dc.date.available |
2021-02-25T06:52:13Z |
|
dc.date.issued |
2020 |
|
dc.identifier.issn |
1742-6588 |
|
dc.identifier.uri |
https://dspace.kpfu.ru/xmlui/handle/net/161190 |
|
dc.description.abstract |
© Published under licence by IOP Publishing Ltd. In our paper, we consider some approaches to accelerating the calculation of the Greatest Common Divisor (GCD) of natural numbers for given A and B based on the k-ary GCD algorithm. Such a task arises in the implementation of many mathematical and number-theoretic algorithms, for example, in cryptography and number theory (see [8]). |
|
dc.relation.ispartofseries |
Journal of Physics: Conference Series |
|
dc.title |
Study of the k-ary GCD Algorithm |
|
dc.type |
Conference Paper |
|
dc.relation.ispartofseries-issue |
1 |
|
dc.relation.ispartofseries-volume |
1658 |
|
dc.collection |
Публикации сотрудников КФУ |
|
dc.source.id |
SCOPUS17426588-2020-1658-1-SID85096363849 |
|