An approximating k-ary GCD algorithm

被引：4
|
作者：
Ishmukhametov, Sh. [1 ]
机构：
[1] Kazan Volga Reg Fed Univ, Inst Computat Math & Informat Technol, Kremlevskaya Ul 18, Kazan 420008, Tatrstan, Russia
来源：
LOBACHEVSKII JOURNAL OF MATHEMATICS | 2016年 / 37卷 / 06期
关键词：
Euclidian GCD algorithm; k-ary GCD; Weber-Jebelean algorithm; Farey series;
D O I：
10.1134/S1995080216060147
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：723 / 729
页数：7
相关论文
共 50 条
12345