电邮这篇文章 An approximating k-ary GCD algorithm
- 作者: Ishmukhametov S.1
-
隶属关系:
- Institute of Computational Mathematics and Information Technologies
- 期: 卷 37, 编号 6 (2016)
- 页面: 723-729
- 栏目: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/198413
- DOI: https://doi.org/10.1134/S1995080216060147
- ID: 198413
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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.
作者简介
Sh. Ishmukhametov
Institute of Computational Mathematics and Information Technologies
编辑信件的主要联系方式.
Email: ishm@nextmail.ru
俄罗斯联邦, Kremlevskaya ul. 18, Kazan, Tatrstan, 420008
