CTF-reverse-daily(2)-wow

链接:http://pan.baidu.com/s/1eS9JNP4 密码:ltl4

本体分析比较简单,算法是解一个22元一次方程

这里引入了numpy这样一个python库,灰常强大

import numpy

NUM=0x16
matrix=[[0 for i in range(NUM)] for j in range(NUM)]
strings = [
"ThelightTokeepinmindtheholylight",
"Timeismoneymyfriend",
"WelcometotheaugerRuiMa",
"Areyouheretoplayforthehorde",
"ToarmsyeroustaboutsWevegotcompany",
"Ahhwelcometomyparlor",
"Slaytheminthemastersname",
"YesrunItmakesthebloodpumpfaster",
"Shhhitwillallbeoversoon",
"Kneelbeforemeworm",
"Runwhileyoustillcan",
"RisemysoldiersRiseandfightoncemore",
"LifeismeaningleshThatwearetrulytested",
"BowtothemightoftheHighlord",
"ThefirstkillgoestomeAnyonecaretowager",
"Itisasitshouldbe",
"Thedarkvoidawaitsyou",
"InordertomoregloryofMichaelessienray",
"Rememberthesunthewellofshame",
"Maythewindguideyourroad",
"StrengthandHonour",
"Bloodandthunder"
]

verify=[
0x000373ca,
0x00031bdf,
0x000374f7,
0x00039406,
0x000399c4,
0x00034adc,
0x00038c08,
0x00038b88,
0x00038a60,
0x0002b568,
0x00032471,
0x00037dea,
0x00036f97,
0x000378e4,
0x00038706,
0x00029010,
0x00034c23,
0x00038ef8,
0x00038e29,
0x0003925e,
0x0002b5fc,
0x0002584e
]

def gen_matrix():
    for i in range(NUM):
        for j in range(NUM):
            matrix[i][j]=0

    for i in range(NUM):
        for j in range(len(strings[i])):
            if j>=NUM:
                break
            matrix[i][j]=ord(strings[i][j])

if __name__==‘__main__‘:
    gen_matrix()
    verify=numpy.array(verify)
    matrix=numpy.array(matrix)
    a=numpy.linalg.solve(matrix,verify)
    print a
b=[ 104, 99, 116,102,123,76,74,95,121,54,  99, 100, 99,    95, 113, 119, 101, 101, 114, 116,  33, 125]c=‘‘for i in b:    c+=(chr(i))print c
				
时间: 2024-10-29 10:46:17

CTF-reverse-daily(2)-wow的相关文章

浙大ctf REVERSE

Classical Crackme 字符串base64 解密即可

【CTF】Reverse CSC2015 120

来源: Cyber Security Challenge 2015 题目:Crackme 类型: Reverse 分数: 120 难度:中(难中易三个级别) 描述: We found this binary, but we lost the password. Please retrieve it for us. 题目链接:https://github.com/ctfs/write-ups-2015/tree/master/cyber-security-challenge-2015/revers

【CTF】Reverse [email protected]

来源: 360 CTF 2014 Reverse20 说明:已在压缩包中给定了一个用ReverseMe.exe加密过后的文件:密文.db请分析ReverseMe.exe的算法,写出解密算法,解密该文件得到Key.该Exe里有一个bug,导致exe无法运行:提示:你有两种方法得到该Key:1.找到bug,patch掉之后,运行两次该程序即可解密文件得到key.2.老老实实的逆这个简单的算法,写出一个解密程序,解密. 答案: [CTF]Reverse [email protected]

【CTF】Reverse Backdoor 2015 Echo

来源: Backdoor CTF 2015 Little Suzie started learning C. She created a simple program that echo's back whatever you input. Here is the binary file. The vampire came across this service on the internet. nc hack.bckdr.in 8002. Reports say he found a flag

CTF入门之reverse

原文地址:https://www.cnblogs.com/qing123tian/p/11183088.html

Pediy CTF 2018 reverse

00401057 |. /0F87 B0000000 |ja 18a51cbc.0040110D 0040105D |. |33DB |xor ebx,ebx ; 清空ebx 0040105F |> |8A441C 14 |/mov al,byte ptr ss:[esp+ebx+0x14] ; 拿到假码的第一个字节 00401063 |. |84C0 ||test al,al ; 判断拿到的是否为空 00401065 |. |74 49 ||je short 18a51cbc.004010B0

2016 SWPU CTF的WriteUp

2.1.题目信息 地址: QQ群:184517991 分值: 50分Flag: flag{welcome_swpu_ctf} 2.2.解题过程 进入他们官方的QQ群,找了一圈没找到Flag,然后问了下管理员,管理员表示Flag在历史公告,But我的Mac QQ并不能看历史公告,于是... 嗯,这是一道送分题 3.Misc150(Misc2) 2.1.题目信息 地址: http://misc.08067.me/misc2/misc.pcapng分值: 150分Flag: flag{Rgb_dhsk

0ops CTF/0CTF writeup

0×00 0CTF『第一届0ops信息安全技术挑战赛,即0ops Capture The Flag,以下简称0CTF. 0CTF由上海交通大学网络信息中心和上海市信息安全行业协会指导,由上海交通大学信息网络安全协会承办,是2014信息安全技能竞赛校园赛首站.0CTF注册与参赛地址为http://ctf.0ops.net. 比赛时间为北京时间2014年3月1日至2日,每天7时至23时,共32小时.』 看官方微博,这个比赛本来是面向上交校内的,就是校外可以做题但是不发奖,后来也给校外发奖了,整体感觉

(KMP 水)Wow! Such Doge! -- hdu -- 4847

http://acm.hdu.edu.cn/showproblem.php?pid=4847 Wow! Such Doge! Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Practice HDU 4847 Description Chen, Adrian (November 7, 2013). “Doge Is An Ac- tually Good Inter

(KMP 水)Wow! Such Doge! -- hdu

http://acm.hdu.edu.cn/showproblem.php?pid=4847 Wow! Such Doge! Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Practice HDU 4847 Description Chen, Adrian (November 7, 2013). “Doge Is An Ac- tually Good Inter