一道简单的RSA签到题(175 points)
题目:Oligar’s Tricky RSA
c = 97938185189891786003246616098659465874822119719049
e = 65537
n = 196284284267878746604991616360941270430332504451383
题目破解
步骤一:分解大整数n
p=10252256693298561414756287
q=19145471103565027335990409
步骤二:计算私钥d
import libnum
t = (p-1)*(q-1)
d = libnum.invmod(e,t)
步骤三:破解密文c
from Crypto.Util.number import long_to_bytes
m = pow(c,d,n)
print(long_to_bytes(m))
Flag:nactf{sn3aky_c1ph3r}