已知e,n,c,p,q(但是n?=p*q)
例如：'''n=p*p*p*q*q'''
import gmpy2
from Crypto.Util.number import *
e =
q =
p =
c =
n = p*p*p*q*q
'''当n分解类似p*p*p
phi = p*p*p-p*p
'''
phi = (p**3-p**2)*(q**2-q)
d = gmpy2.invert(e,phi)
print(d)
m = gmpy2.powmod(c,d,n)
print(long_to_bytes(m))