标签：欧几里得   算法   python   reference   href   print   ike   欧几里得算法   item   

已知p,q,e求d

p=473398607161
q=4511491
e=17
n = (p-1) * (q-1)

def extendedEuclid(a, b):
    if b == 0:
        return 1, 0
    else:
        x, y= extendedEuclid(b, a % b)
        x, y = y, (x - (a // b) * y)
        return x, y
d = extendedEuclid(e,n)[0]
print(d)

Reference

https://baike.baidu.com/item/扩展欧几里得算法/2029414?fr=aladdin

RSA

标签：欧几里得   算法   python   reference   href   print   ike   欧几里得算法   item   

原文地址：https://www.cnblogs.com/vict0r/p/13192535.html