已知c,e,n 求m(n能分解p,q)
import gmpy2
from Crypto.Util.number import *
c =
e =
n =
n = p*q #yafu factordb.com分解n
p =
q =
phi = (p-1)*(q-1)
d = gmpy2.invert(e,phi)
m = gmpy2.powmod(c,d,n)
print(long_to_bytes(m))
标签：phi,gmpy2,rsa,常规,import,模板 From： https://www.cnblogs.com/shadowkillnet/p/17754350.html