def produce_CRT():
(p,q) = produce_p_q()
n = p*q
Euler = (p-1)*(q-1) #欧拉函数
d = Euclid.extended_Euclid(e,Euler)#求出e模Euler的逆元d，e*d=1mod（Euler）
dP = Euclid.extended_Euclid(e,p-1)
dQ = Euclid.extended_Euclid(e,q-1)
qInv = Euclid.extended_Euclid(q,p)
return (p,q,n,d,dP,dQ,qInv)
def produce_e_d():
"""产生(e,d)"""
e = 3
while True:
d = Euclid.extended_Euclid(e,m)#e*d=1modm
if Euclid.gcd(m,e) == 1 and d > 0:
break
else:
e += 2
return (e,d)
def produce_e_d():
"""产生(e, d)"""
# Generate a number e so that gcd(e, m) = 1, start with e = 3
e = 3
while True:
d = Euclid.extended_Euclid(e, m)
if Euclid.gcd(m, e) == 1 and d > 0:
break
else:
e += 2
return (e, d)
def gen_e_d(m):
"""
产生(e, d); m is p1 * q1
:param m:
:return:
"""
# Generate a number e so that gcd(e, m) = 1, start with e = 3
e = 3
while True:
d = Euclid.extended_Euclid(e, m)
if Euclid.gcd(m, e) == 1 and d > 0:
break
else:
e += 2
return e, d
