wordpress需要的插件吗,搜索引擎优化工作原理的先后顺序,网站制作及排名优化,保险网站源码REVERSE-PRACTICE-CTFSHOW-6真的是签到批量生产的伪劣产品来一个派森snake真的是签到
附件是一个压缩包#xff0c;解压需要密码#xff0c;但是题目没有给到解压密码 实际上是压缩包伪加密#xff0c;将如图橙色处原本的字节0x09改为0x00#xff0c;保存后即可解压出文件…
REVERSE-PRACTICE-CTFSHOW-6真的是签到批量生产的伪劣产品来一个派森snake真的是签到
附件是一个压缩包解压需要密码但是题目没有给到解压密码 实际上是压缩包伪加密将如图橙色处原本的字节0x09改为0x00保存后即可解压出文件 解压得到一个32位的exe加了ASP壳用工具脱壳 脱壳后的exe丢进ida仍然得不到重要的信息上x32dbg调试 exe丢进x32dbgx32dbg会预先设置一个断点在断点窗口可以看到 我们先按一下F9来到x32dbg预先设置的断点处如图所示 经过多次调试发现程序在执行如图所示处的jmp _unpacked.401280指令后就会要求我们输入这里下一个断点 F8跟进jmp _unpacked.401280在如图所示处的call _unpacked.401150按F7步入 然后一路F8来到如下图所示call _unpacked.4012F0处按F7步入 可以看到0x4012F0处开始的函数中包含try again的字符串0x401334处调用了scanf 猜测这里应该就是main函数 用插件Scylladump出程序丢进ida分析其中一些函数名已对照x32dbg进行了修改 主要的逻辑为将输入中的各个字符与下标异或然后反转输入再让输入与已知的res比较 python脚本好像打印不出中文 下面是c脚本得到flag
#includestdio.h
int main()
{int res[18] { 0x6c,0x2f,0x30,0x31,0x32,0x33,0xffffffb6,0xffffffbf,0xffffffa0,0xffffffcf,0x7c,0x71,0x6a,0x6c,0x70,0x64,0x75,0x63 };for (int i 17; i0; i--){res[i] ^ 17-i;printf(%c, res[i]);}printf(\n);return 0;
}
// ctfshow{签到?????}批量生产的伪劣产品
apk文件jadx-gui打开 先看AndroidManifest.xml文件找到两个关键的类“appinventor.ai_QA629A242D5E83EFA948B9020CD35CB60.checkme.a和”.Screen1 在appinventor.ai_QA629A242D5E83EFA948B9020CD35CB60.checkme.a类中直接找到flag
来一个派森
.py文件打包成的exe用pyinstxtractor.py解包 uncompyle6反编译checkme.pyc文件 (可反编译的前提是checkme.pyc文件与struct.pyc文件前12个字节相同) b58encode的逻辑为先对输入进行base58变换变换后再与下标异或最后和check比较
def b58encode(tmp: str) - str:tmp list(map(ord, tmp))temp tmp[0]base58 123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyzfor i in range(len(tmp) - 1):temp temp * 256 tmp[(i 1)]tmp []while 1:tmp.insert(0, temp % 58)temp temp // 58if temp 0:breaktemp for i in tmp:temp base58[i]tmp []for i in range(len(temp)):tmp.append(chr(ord(temp[i]) ^ i))check [A, 5, q, O, g, q, d, \x7f, [, \x7f, s, {, G, A, x, , D, , K, c, -, c, , G, , , |, x, }, J, h, \\, l]if tmp check:return 1else:return 0flag input(输入flag)
if b58encode(flag):print(you win)
else:print(try again)逆向逻辑为将check各元素与下标异或再解base58
def b58decode(tmp:str) - str:import binasciibase58 123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyztemp []for i in tmp:temp.append(base58.index(i))tmp temp[0]for i in range(len(temp)-1):tmp tmp * 58 temp[i1]return binascii.unhexlify(hex(tmp)[2:].encode(utf-8)).decode(UTF-8)
check [A, 5, q, O, g, q, d, \x7f, [, \x7f, s, {, G, A, x, , D, , K, c, -, c, , G, , , |, x, }, J, h, \\, l]
for i in range(len(check)):check[i]chr(ord(check[i])^i)
print(b58decode(.join(c for c in check)))
# ctfshow{zhe_bu_shi_flag}snake
.py文件打包成的exe用pyinstxtractor.py解包 uncompyle6反编译snake.pyc文件
# -*- coding:utf-8 -*-
import hashlib, sys, random, time
maze [[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],[1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0],[0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0],[0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0],[0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0],[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0],[0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0],[0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0],[0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0],[0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0],[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0],[0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 9]]
s str(input()) # 读取输入
seed time.time()
random.seed(seed)
random.seed(random.randint(0, 999999))
maze[1][1] random.randint(987, 1000)
maze[3][4] random.randint(345, 356)
maze[7][7] random.randint(107, 116)
maze[11][8] random.randint(833, 856)
for i in range(12):for j in range(12):tmp 12 * i jif maze[i][j] 0:maze[i][j] 3456 tmpcontinueif tmp % 4 0:random.seed(maze[1][1])for cnt in range(tmp):random.randint(0, 999)maze[i][j] random.randint(0, 999)elif tmp % 4 1:random.seed(maze[3][4])for cnt in range(tmp):random.randint(555, 1234)maze[i][j] random.randint(555, 1234)elif tmp % 4 2:random.seed(maze[7][7])for cnt in range(tmp):random.randint(777, 888)maze[i][j] random.randint(777, 888)elif tmp % 4 3:random.seed(maze[11][8])for cnt in range(tmp):random.randint(369, 777)maze[i][j] random.randint(369, 777)maze[11][11] 9
# 以上都是对maze的变换
if len(s) ! 56:sys.exit(-1)
idx1 0
idx2 0
# 走迷宫 wsad代表上下左右 从左上角[0,0]开始
for i in s:if i w:idx1 - 1else:if i s:idx1 1else:if i a:idx2 - 1else:if i d:idx2 1# 每走一步后的坐标在maze中的值要大于等于0且小于等于1234if not 0 maze[idx1][idx2] 1234:print(Where are you going?)sys.exit(2)
# 走到右下角[11,11]成功
if maze[idx1][idx2] ! 9:print(You lost in the maze!)
# 从maze中取值构成result
result
for xx in maze:for xxx in xx:result str(xxx)hash_res hashlib.sha256(result.encode(latin-1)).hexdigest()
print(hash_res)
# 由于maze中含有随机数所以即使迷宫路线正确也可能得不到flag需要多次尝试
if hash_res f1793dcf5ad3858512b944ac34413725a27c63e25618858231e88b9686466b00:flag1 str(maze[1][1]) str(maze[7][7]) str(maze[11][8]) str(maze[3][4])flag2 hashlib.sha256(s.encode(latin-1)).hexdigest()flag flag2[::-1] flag1[::-1]final_flag hashlib.sha256(flag.encode(latin-1)).hexdigest()print(flag{ final_flag[0:32] })已知迷宫路线的约束为“每走一步后的坐标在maze中的值要大于等于0且小于等于1234” 提取出源代码对maze的变换再将maze中大于等于0且小于等于1234的值改为1其余改为0 打印maze即可得到正确的迷宫路线
import hashlib, sys, random, time
maze [[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],[1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0],[0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0],[0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0],[0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0],[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0],[0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0],[0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0],[0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0],[0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0],[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0],[0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 9]]
seed time.time()
random.seed(seed)
random.seed(random.randint(0, 999999))
maze[1][1] random.randint(987, 1000)
maze[3][4] random.randint(345, 356)
maze[7][7] random.randint(107, 116)
maze[11][8] random.randint(833, 856)
for i in range(12):for j in range(12):tmp 12 * i jif maze[i][j] 0:maze[i][j] 3456 tmpcontinueif tmp % 4 0:random.seed(maze[1][1])for cnt in range(tmp):random.randint(0, 999)maze[i][j] random.randint(0, 999)elif tmp % 4 1:random.seed(maze[3][4])for cnt in range(tmp):random.randint(555, 1234)maze[i][j] random.randint(555, 1234)elif tmp % 4 2:random.seed(maze[7][7])for cnt in range(tmp):random.randint(777, 888)maze[i][j] random.randint(777, 888)elif tmp % 4 3:random.seed(maze[11][8])for cnt in range(tmp):random.randint(369, 777)maze[i][j] random.randint(369, 777)maze[11][11] 9for i in range(12):for j in range(12):if maze[i][j]0 and maze[i][j]1234:maze[i][j]1else:maze[i][j]0print(maze[i])
# [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
# [1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0]
# [0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0]
# [0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0]
# [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0]
# [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
# [0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0]
# [0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0]
# [0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0]
# [0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0]
# [0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0]
# [0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
# sdsdsddwwddsdddssaaassddddssasaaaaawwwaaasssdsdsdddddddd爆破一下能不能得到flag全看运气
from itertools import *
import subprocess
while(1):flagsdsdsddwwddsdddssaaassddddssasaaaaawwwaaasssdsdsddddddddp subprocess.Popen([D:\\ctfdownloadfiles\\snake.exe], stdinsubprocess.PIPE, stdoutsubprocess.PIPE,stderrsubprocess.PIPE)p.stdin.write(flag)p.stdin.close()out p.stdout.read()p.stdout.close()if flag in out:print(out)exit()
# f1793dcf5ad3858512b944ac34413725a27c63e25618858231e88b9686466b00
# flag{e1df25dac4906584fe2d6f155b60e233}
