0x00 前言
CTF 加解密合集:CTF 加解密合集
0x01 题目
密文:2559659965656A9A65656996696965A6695669A9695A699569666A5A6A6569666A59695A69AA696569666AA6
0x02 Write Up
提示给了这个是曼彻斯特编码,这个编码的特点就是相对于正常的二进制而言,10是1,01是0,然后再进行转换:
首先转换成2进制:
10010101011001011001011001100101100101011001010110101010011010011001010110010101101001100101100110100101101001011001011010011001101001010101100110100110101001011010010101101001101001100101010110100101100110011010100101101001101010011001010110100101100110011010100101100101101001010110100110100110101010011010010110010101101001011001100110101010100110
然后进行分割:
s="10010101011001011001011001100101100101011001010110101010011010011001010110010101101001100101100110100101101001011001011010011001101001010101100110100110101001011010010101101001101001100101010110100101100110011010100101101001101010011001010110100101100110011010100101100101101001010110100110100110101010011010010110010101101001011001100110101010100110"
x=""
for i in range(0,len(s),2):
s1=s[i:i+2]
if s1=="10":
x+="1"
elif s1=="01":
x+="0"
print(x)
得到:
1000010010010100100010001111011010001000110100101100110010011010110000101101110011000110110100001100101011100110111010001100101011100100110001101101111011001000110010101111101
然后转换为16进制:
最后再进行转换:
以上