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 条
  • [31] Reconfigurable k-ary tree multiprocessors
    Izadi, B.A.
    Ozguner, F.
    International Journal of Parallel and Distributed Systems and Networks, 2000, 3 (04): : 227 - 234
  • [32] On k-ary spanning trees of tournaments
    Lu, XY
    Wang, DW
    Chang, GJ
    Lin, IJ
    Wong, CK
    JOURNAL OF GRAPH THEORY, 1999, 30 (03) : 167 - 176
  • [33] Performance evaluation of the bubble algorithm:: Benefits for k-ary n-cubes
    Carrión, C
    Beivide, R
    Gregorio, JA
    PROCEEDINGS OF THE SEVENTH EUROMICRO WORKSHOP ON PARALLEL AND DISTRIBUTED PROCESSING, PDP'99, 1999, : 349 - 356
  • [34] A novel routing algorithm for k-ary n-cube interconnection networks
    Demaine, ED
    Srinivas, S
    INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 1996, 8 (01): : 81 - 92
  • [35] Routing in bidirectional k-ary n-cubes with the Red Rover algorithm
    Draper, J
    Petrini, F
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 1184 - 1193
  • [36] A randomized algorithm for dynamic tree growing on k-ary n-cubes
    Li, KQ
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 600 - 609
  • [37] Stagewise learning for noisy k-ary preferences
    Yuangang Pan
    Bo Han
    Ivor W. Tsang
    Machine Learning, 2018, 107 : 1333 - 1361
  • [38] GENERATING K-ARY TREES IN LEXICOGRAPHIC ORDER
    ZHU, Y
    WANG, J
    SCIENTIA SINICA, 1980, 23 (10): : 1219 - 1225
  • [39] Generation of assembly sequences with k-ary operations
    Wang, Haixia
    Ceglarek, Dariusz J.
    2007 IEEE INTERNATIONAL SYMPOSIUM ON ASSEMBLY AND MANUFACTURING, 2007, : 50 - +
  • [40] The rotation graph of k-ary trees is Hamiltonian
    Huemer, Clemens
    Hurtado, Ferran
    Pfeifle, Julian
    INFORMATION PROCESSING LETTERS, 2008, 109 (02) : 124 - 129
12345