Kazan Federal University Digital Repository
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 | Ishmukhametov S. | |
| dc.date.accessioned | 2018-09-19T22:10:49Z | |
| dc.date.available | 2018-09-19T22:10:49Z | |
| dc.date.issued | 2016 | |
| dc.identifier.issn | 1995-0802 | |
| dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/144821 | |
| dc.description.abstract | © 2016, Pleiades Publishing, Ltd.In our paper we elaborate a new version of the k-ary GCD algorithm. Our algorithm is based on the Farey Series and surpasses all existing realizations of the k-ary algorithm. It can have practical applications inMathematics and Cryptography. | |
| dc.relation.ispartofseries | Lobachevskii Journal of Mathematics | |
| dc.subject | Euclidian GCD algorithm | |
| dc.subject | Farey series | |
| dc.subject | k-ary GCD | |
| dc.subject | Weber–Jebelean algorithm | |
| dc.title | An approximating k-ary GCD algorithm | |
| dc.type | Article | |
| dc.relation.ispartofseries-issue | 6 | |
| dc.relation.ispartofseries-volume | 37 | |
| dc.collection | Публикации сотрудников КФУ | |
| dc.relation.startpage | 723 | |
| dc.source.id | SCOPUS19950802-2016-37-6-SID84994519213 |
Files in this item
This item appears in the following Collection(s)
-
Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.