The Uniform Recursive Algorithm for Seeking the GCD, Multiplicative Inverse or General Solutions to a Simple Congruence (Outline)
Shenghui Su
1
1、School of Information Engineering, University of Science & Technology Beijing
2、Guanghua School of Management, Peking University
Abstract:Different from the extended Euclidean algorithm which can only compute directly the multiplicative inverse of an element in Z* m and the greatest common divisor of two integers, a recursive algorithm called REESSE0 is designed by the authors, which can not only seek directly the multiplicative inverse and greatest common divisor, but also solve directly a simple congruence for the general solutions. The paper presents curtly the definition and two valuable properties of a simple congruence, analyzes in detail the reduction and recursion process of solving simple congruences, on the basis of the analyses, induces the recursive formula for solving simple congruences, and describe formally and implement in C language the recursive algorithm. At last, compares the REESSE0 algorithm with the extended Euclidean algorithm in thoughts, applicabilities and time complexities.