基于kary消减的快速最大公约数算法.docVIP

基于kary消减的快速最大公约数算法 最大公约数(GCD)算法中是计算数论 的基础课题之一，它在密码算法和密码分析中有着非 常广泛的应用，对于输入B和C，利用Sorenson的右 移 kary 消减(rightshift kary reduction)思想提出一个 算法用于寻找整数x和y，使得x和y满足Bx-Cy在二 进制表示下低比特位部分为0,即Bx-Cy=0(mod 2e)， 其中e是常数正整数。利用该算法能够右移较多比特 并大规模降低循环次数。再结合模算法，提出了快速 GCD算法，其输入规模为n比特时最差复杂度仍然是 0 (n2),但最好的情况下复杂度能达到0 (运算顺序 是否要加括号由于该方向的表述都是这样，所以这样 描述是合理的。0 (nlog2nloglogn) 就是 0 (n*logA2 (n) *log (log (n)))。n Iog2 n log logn)0实验数据表明，对于20万以上比特规模的输 入，快速GCD算法比Binary GCD算法速度快；对100 万比特规模的输入，快速GCD算法速度是Binary GCD 法的两倍。 关键词：最大公约数算法；欧几里得算法；二进 制最大公约数算法；右移kary消减；整数最大公约 :fjI :fj 3x1 ■ — TP309 A 英文 Abstract： Greatest Common Divisor (GCD) is one of the basic subjects in computational number theory. It has a wide application in encryption and analysis of cryptography. For inputing B and C， an algorithm based on rightshift kary reduction proposed by Sorenson was presented for finding the integers x and y which satisfy the least significant bits of Bx-Cy were 0，i.e.， Bx-Cy=0 (mod 2e) where positive integer e was a constant. It could do a lot of right shifts and reduce a large number of cycles with taking advantage of the algorithm for finding the integers x and y. A fast GCD algorithm was proposed combined with modulus algorithm. When the size of the input was n bits， the worst complexity of the fast GCD algorithm was still 0 (n2) ? In the best case， the complexity of the proposed algorithm could achieve 0 (n Iog2 n log log n) . The experimental data show that actual implementations given input about more than 200000 bits, the fast GCD algorithm is faster than the Binary GCD algorithm, and the fast GCD algorithm is twice as fast as the Binary GCD algorithm for 1 million bits of input. 英文关键词 Key words： Greatest Common Divisor (GCD) algorithm； Euclidean algorithm； binary Greatest Common Divisor (GCD) algorithm； rightshift kary reduction； integer greatest common divisor algorithm 0引言 求最大公约数(Greatest Common Divisor，GCD) 算法在计算代数、密码学中都有广泛的应用。文献［1］ 第二 ？在查阅一些引用了该文献的文章时发现， 所有的文章都是Jebelean作为主 要 ，而且国外文章有共同一作的说法，所以， 这里按照固有习