-
-
[原创]2020KCTF秋季赛第三题重返地球wp
-
发表于:
2020-11-22 09:53
4292
-
with open('log.txt','r') as fp:
lines = fp.readlines()
res = []
for line in lines:
if "add_node_0" in line:
p_start = line.find('0x')
p_end = line.find('u')
n = int(line[p_start:p_end],16)
res.append(n)
splits_lists = [res[37*i:37*(i+1)][::-1] for i in range(38)]
wanted= splits_lists[-1]
data = splits_lists[:-1][::-1]
A = Matrix(GF(29527),data)
y = vector(GF(29527),wanted)
A_ = A.inverse()
x = A_*y
res = ''.join([chr(n) for n in x])
print(res)
with open('log.txt','r') as fp:
lines = fp.readlines()
res = []
for line in lines:
if "add_node_0" in line:
p_start = line.find('0x')
p_end = line.find('u')
n = int(line[p_start:p_end],16)
res.append(n)
splits_lists = [res[37*i:37*(i+1)][::-1] for i in range(38)]
wanted= splits_lists[-1]
data = splits_lists[:-1][::-1]
[培训]内核驱动高级班，冲击BAT一流互联网大厂工作，每周日13:00-18:00直播授课
最后于 2020-11-22 09:57
被afa9040e编辑
，原因：
