【摘要】 扩展欧几里德算法用来找到一组整数解x,y,使得满足等式ax+by=gcd(a,b),该算法在RSA公钥密码系统中有重要应用。文章改进后的扩展欧几里德算法可以在编程中减少参数个数和赋值运算次数,一定程度地降低算法的空间复杂度和时间复杂度。更多还原

【Abstract】 The extended Euclidean algorithm is used to find a pairof integers x and y, so that the equation ax+ by= gcd(a,b)is satisfied. This algorithm has important application in R SA public key cryptosystem. The improved extended Euclidean algorithm can reduce the numberof parameters and the numberof assignment operations in programming, and, reduce the space complexity and the time complexity of the algorithm to a certain extent.更多还原