Kazan Federal University Digital Repository
On implementation of an approximating k-ary GCD algorithm
- Home
- →
- Научные публикации в Scopus
- →
- Публикации сотрудников КФУ Scopus
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Amer I.F. | |
| dc.contributor.author | Mohammed H.N. | |
| dc.date.accessioned | 2021-02-25T06:53:28Z | |
| dc.date.available | 2021-02-25T06:53:28Z | |
| dc.date.issued | 2020 | |
| dc.identifier.issn | 1757-8981 | |
| dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/161302 | |
| dc.description.abstract | © Published under licence by IOP Publishing Ltd. In our paper, we investigate some implementations of an approximating k-ary GCD algorithm (AKA) for calculating the greatest common divisor of natural numbers for given A and B. This task has a great importance in the development of parameters for cryptographic encryption methods. | |
| dc.relation.ispartofseries | IOP Conference Series: Materials Science and Engineering | |
| dc.title | On implementation of an approximating k-ary GCD algorithm | |
| dc.type | Conference Paper | |
| dc.relation.ispartofseries-issue | 5 | |
| dc.relation.ispartofseries-volume | 862 | |
| dc.collection | Публикации сотрудников КФУ | |
| dc.source.id | SCOPUS17578981-2020-862-5-SID85086337858 |
Files in this item
This item appears in the following Collection(s)
-
Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.