前言
来源:school-ctf-winter-2015
这题目名字也忒长了,linux c题
题解


just_a_string = [115, 116, 114, 97, 110, 103, 101, 95,
                 115, 116, 114, 105, 110, 103, 95, 105, 116, 95, 105, 115]
differences = [0, 9, -9, -1, 13, -13, -4, -11, -
               9, -1, -7, 6, -13, 13, 3, 9, -13, -11, 6, -7]
for j in range(26):
    flag = ""
    for i in range(20):
        flag += chr(differences[i]+j+97)
    print(flag)爆破,然后看哪个可能性大
爆破也分正反向啊

 
                        
                        ![刷题笔记:[XCTF-4th-WHCTF-2017]EASYHOOK](/medias/featureimages/47.jpg)