New Modified Euclidean and Binary Greatest Common Divisor Algorithm

Abstract

ABSTRACTThe greatest common divisor (GCD) computation of non-negative integers are the open problem in arithmetic calculations such as cryptography, and factorization attacks. The integer GCD algorithm applies one or more different transformations to reduce the size of input integers a and b at each step performed. Such kinds of transformations are called as reduction. Based on the different reductions, we proposed an efficient implementation of Modified Euclid-Binary (ModEB) algorithm. The ModEB algorithm is based on modular reduction of Euclid's algorithm and the reduction based on the Binary GCD algorithm, where it reduces the integers by the largest powers of two and avoids multiplication and division, except by the powers of two, and hence it is potentially faster than the Euclid's and Binary algorithms. The worst case time complexity of the proposed algorithm is O(n2) with respect to the bit-time complexity for two n-bit integers. We also proposed the parallel version of GCD algorithm. The implementation results show that the iteration required to compute GCD using ModEB algorithm are substantially less as compared to different GCD algorithms.