python求e和最后的n_RSA 问题求助 （已知N,e 求m（flag））

#MOM! I use prime number it twice!

from Crypto.Util.number import *

p = getPrime(1024)

q = p

N = p * q

e = 65537

c = "xxxxxxxxxxxxxxx" # secret!

c = bytes_to_long(c)

c = pow(c, e, N)

print("N = " + str(N))

print("e = " + str(e))

print("c = " + str(c))

N=28491931308316768625781964099146732125764726410614200070543171136417671631198802680922080801311215792835682973479588021728013373250244448518113296934532713859987683675746019269353812527256199040019500042846602802497110930394273647224169946221300212766598839910908590573319040840303100277840991087707396758686621729989298866146688863302550566891495003420236469622350944304328013773585074147355440019876004001115252532894419815588724580803265630906389658145235159071993520859506538087645774872878608114002570614664376