第九届浙江省大学生网络安全竞赛决赛 Writeup
原创
N1bbl3 安全团队
N1bbl3 安全团队
N1bbl3
2026年11月18日 15:10
浙江
去阅读
![]()
key = b\"0xA7B3C5D1\" + b\"F1B0NACC1DECRYPT\" + b\"V1SU4L9X\"
ct = bytes.fromhex(\"743912741675384431052845375d113372334128761c663a226425420c3105210a3643497159314e\")
print(bytes(c ^ key[i % len(key)] for i, c inenumerate(ct)).decode())
●●●PLAIN TEXT
DASCTF{qu4ntum_r1ppl3_4cr0ss_d1m3ns10ns}
键盘侠的 USB 日记
41×41 里 b 的边界在行 5–37、列 5–37,四边各 4 格是静区,实际是 33×33 的 QR v4。裁出 33×33,补 4 格静区,b 当黑渲染,直接解码。渲染脚本:
●●●PYTHON
import cv2
import numpy as np
rows = open(\"qr_keyboard.txt\").read().split()
grid = [row[4:37] for row in rows[4:37]]
n = len(grid)
scale = 10
quiet = 4
img = np.full(((n + 2 * quiet) * scale, (n + 2 * quiet) * scale), 255, dtype=np.uint8)
for y, row inenumerate(grid):
for x, ch inenumerate(row):
if ch == \"b\":
y0 = (y + quiet) * scale
x0 = (x + quiet) * scale
img[y0:y0+scale, x0:x0+scale] = 0
data, _, _ = cv2.QRCodeDetector().detectAndDecode(img)
print(data)
●●●PLAIN TEXT
DASCTF{9a37252d-3e8e-4e79-a492-4b488b5c18ad}
AI
好评刷单
只用固定 60 对训练时,polite 权重过大,目标输给干扰项。候选池 12 个回答,66 个无序对 × 2 方向,贪心选 7 条,每步重跑 2000 步拟合,按“赢全部干扰项 → 探针胜出的组数 → 留出集 → 分差”选优。贪心搜索:
●●●PYTHON
import numpy as np
from reward_model import fit, accuracy
d = np.load(\"public.npz\")
Phi = d[\"Phi_pool\"]
Phi_d = d[\"Phi_d\"]
phi_t = d[\"phi_t\"]
fixed = [tuple(x) for x in d[\"fixed_pairs\"]]
holdout = [tuple(x) for x in d[\"holdout_pairs\"]]
groups = d[\"public_groups\"]
k = int(d[\"k\"])
cands = []
for i inrange(12):
for j inrange(i + 1, 12):
cands.append((i, j, i))
cands.append((i, j, j))
defevaluate(pairs):
w = fit(Phi, fixed + pairs)
t = w @ phi_t
ds = Phi_d @ w
win = bool(t > ds.max())
probe = sum(t > ds[g].max() for g in groups)
acc = accuracy(w, Phi, holdout)
margin = t - ds.max()
return (win, probe, acc >= 0.6, margin, acc), w
chosen = []
for _ inrange(k):
best = None
for p in cands:
ifany({p[0], p[1]} == {q[0], q[1]} for q in chosen):
continue
s, w = evaluate(chosen + [p])
if best isNoneor s > best[0]:
best = (s, p, w)
chosen.append(best[1])
s, w = evaluate(chosen)
print(chosen)
print(s)
print(w)
提交:
●●●JSON
{\"pairs\":[
{\"i\":10,\"j\":11,\"winner\":11},
{\"i\":5,\"j\":10,\"winner\":5},
{\"i\":6,\"j\":7,\"winner\":7},
{\"i\":3,\"j\":6,\"winner\":3},
{\"i\":0,\"j\":10,\"winner\":0},
{\"i\":4,\"j\":7,\"winner\":7},
{\"i\":7,\"j\":10,\"winner\":7}
]}
POST /verify:
●●●JSON
{\"success\":true,\"probe_rate\":1.0,\"clean_accuracy\":0.95,
\"flag\":\"DASCTF{1dd69a44-2e97-e602-d245-9bcbdbb51af6}\"}
数据安全
LibRelay
先过滤出 COMPLETED 1500 笔,再过滤出 SENSITIVE 字段 725 笔;按 MISSING → REVOKED → MISMATCH → NOT_YET → EXPIRED → KEY_INACTIVE 顺序判定,命中即停。“早于”取严格 <,有效期和密钥窗口取闭区间。按规则跑:
●●●PYTHON
import csv
import re
from collections import Counter
from datetime import datetime
sql = open(\"librelay.sql\", encoding=\"utf-8\").read()
defparse_values(s):
vals = []
cur = []
q = False
i = 0
while i < len(s):
c = s[i]
if q:
if c == \"'\"and i + 1 < len(s) and s[i + 1] == \"'\":
cur.append(\"'\")
i += 2
continue
if c == \"'\":
q = False
i += 1
continue
cur.append(c)
i += 1
continue
if c == \"'\":
q = True
i += 1
continue
if c == \",\":
vals.append(\"\".join(cur).strip())
cur = []
i += 1
continue
cur.append(c)
i += 1
vals.append(\"\".join(cur).strip())
return [Noneif v == \"NULL\"else v for v in vals]
deftable(name):
out = []
for m in re.finditer(r\"INSERT INTO `%s` .*? VALUES \\((.*?)\\);\" % name, sql, re.S):
out.append(parse_values(m.group(1)))
return out
g = table(\"gateway_egress_log\")
t = table(\"ticket_archive\")
k = table(\"key_history\")
a = table(\"asset_catalog\")
sens = {r[0] for r in a if r[2] == \"SENSITIVE\"}
tickets = {}
for r in t:
tickets.setdefault(r[0], []).append(r)
keys = {}
for r in k:
keys.setdefault(r[0], []).append(r)
defts(x):
return datetime.fromisoformat(x)
out = []
for r in g:
tid, rid, fid, status, kid, started = r[0], r[1], r[3], r[5], r[6], r[7]
if status != \"COMPLETED\"or fid notin sens:
continue
tr = tickets.get(r[2], [])
iflen(tr) != 1:
code = \"TICKET_MISSING\"
else:
tr = tr[0]
if tr[5] != \"GRANTED\":
code = \"TICKET_REVOKED\"
elif tr[1] != rid or tr[2] != fid:
code = \"TICKET_MISMATCH\"
elifnot (ts(tr[3]) < ts(started)):
code = \"TICKET_NOT_YET\"
elif ts(started) > ts(tr[4]):
code = \"TICKET_EXPIRED\"
else:
kr = keys.get(kid, [])
iflen(kr) != 1ornot (ts(kr[0][1]) <= ts(started) <= ts(kr[0][2])):
code = \"KEY_INACTIVE\"
else:
continue
out.append((tid, code))
print(Counter(code for _, code in out))
withopen(\"expected.csv\", \"w\", encoding=\"utf-8\", newline=\"\") as f:
w = csv.writer(f)
w.writerow([\"transfer_id\", \"issue_code\"])
w.writerows(out)
●●●PLAIN TEXT
TICKET_MISSING 63
TICKET_REVOKED 62
TICKET_MISMATCH 66
TICKET_NOT_YET 60
TICKET_EXPIRED 60
KEY_INACTIVE 54
合计 365
上传 expected.csv:
●●●JSON
{\"state\":1,\"matched\":365,\"total\":365,\"extra\":0,\"missing\":0,
\"flag\":\"DASCTF{067f5cea-d46b-ec6d-6c7d-e86c749f352e}\",\"reason\":\"校验通过\"}
ShieldCall
按规范写成四个函数:姓名保留首尾,电话前 3 后 2,证件保留第 7–14 位,地址只保留首个“苑”之前、其余数字逐位打码。读取 回访任务批次.csv,按合同列序写 answer.csv。批量处理:
●●●PYTHON
import csv
import re
defmask_name(n):
iflen(n) == 2:
return n[0] + \"*\"
return n[0] + \"*\" * (len(n) - 2) + n[-1]
defmask_phone(p):
return p[:3] + \"*\" * 6 + p[-2:]
defmask_id(x):
return\"*\" * 6 + x[6:14] + \"*\" * 4
defmask_addr(s):
keep, rest = re.match(r\"^(.*?苑)(.*)$\", s).groups()
return keep + \"\".join(\"*\"if ch.isdigit() else ch for ch in rest)
rows = list(csv.DictReader(open(\"回访任务批次.csv\", encoding=\"utf-8-sig\")))
fields = [\"任务号\", \"会员姓名\", \"联系电话\", \"证件号码\", \"预约时间\", \"服务地址\", \"派单站点\", \"工单状态\"]
withopen(\"answer.csv\", \"w\", encoding=\"utf-8\", newline=\"\") as f:
w = csv.DictWriter(f, fieldnames=fields, lineterminator=\"\
\")
w.writeheader()
for r in rows:
w.writerow({
\"任务号\": r[\"任务号\"],
\"会员姓名\": mask_name(r[\"会员姓名\"]),
\"联系电话\": mask_phone(r[\"联系电话\"]),
\"证件号码\": mask_id(r[\"证件号码\"]),
\"预约时间\": r[\"预约时间\"],
\"服务地址\": mask_addr(r[\"服务地址\"]),
\"派单站点\": r[\"派单站点\"],
\"工单状态\": r[\"工单状态\"],
})
上传 answer.csv:
●●●JSON
{\"filename\":\"answer.csv\",\"flag\":\"DASCTF{7c61a2b8-1d56-daac-73cf-05f5b0d33ae4}\",
\"position\":0,\"reason\":\"校验通过\",\"score\":100.0,\"state\":1}
持续关注安全动态
关注团队,获取更多安全研究与技术动态。











评论