Email this article An approximating k-ary GCD algorithm
- Authors: Ishmukhametov S.1
-
Affiliations:
- Institute of Computational Mathematics and Information Technologies
- Issue: Vol 37, No 6 (2016)
- Pages: 723-729
- Section: Article
- URL: https://journals.rcsi.science/1995-0802/article/view/198413
- DOI: https://doi.org/10.1134/S1995080216060147
- ID: 198413
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
Sh. Ishmukhametov
Institute of Computational Mathematics and Information Technologies
Author for correspondence.
Email: ishm@nextmail.ru
Russian Federation, Kremlevskaya ul. 18, Kazan, Tatrstan, 420008
