A Circuit for GCD and Extended GCD Calculation With Unlimited Precision

Abstract

In this paper, we present the architecture and implementation of a new algorithm to find the greatest common divisor (GCD) and extended GCD of very large integers (≫ 600 decimal digits). The method uses an internal radix 2 redundant representation and supports multiple precision. In addition, the design methodology was to find the best trade-offs between computation time and area.