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
Цитировать
Аннотация
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
![](/img/style/loading.gif)