通过分析代码可知
n,e,c
c=1*2*3*4*5
那么根据rsa算法求出对应的d
其中n的分解可采用yafu工具
最终结果为b'HSCTF{@Tv0_br3ad5_c1ip_cHe3se_!@}'
最终代码:
import libnum
from Crypto.Util import *
from Crypto.Util.number import *
from functools import reduce
from secret import flag
import functools
import gmpy2
n = 175797137276517400024170861198192089021253920489351812147043687817076482376379806063372376015921
c = 144009221781172353636339988896910912047726260759108847257566019412382083853598735817869933202168
e=65537
r = 9401433281508038261
t = 13716847112310466417
y = 11855687732085186571
u = 11215197893925590897
i = 10252499084912054759
a=(r-1)*(t-1)*(y-1)*(u-1)*(i-1)
d=gmpy2.invert(e,a)
m=pow(c,d,n)
print(long_to_bytes(m))