代码逻辑很简单
for i in range(27,0,-1):
print(i)
for k in range(32,128):
for j in range(17):
t=k
t^= ((j + enc[i]) ^ 0x19)
if t==enc[i-1] and k%17==j:
enc[i-1]=k
print(enc)
,就是解密我不知道怎么解,那个401550函数,看官方wp上说是为了防止多解
最开始我的解法是这样,一直解不出来,我也不知道原因,后来看了dfs深搜,简单的递归一下,才出的,果然是多解
tmp=[0]*27+[125]
enc=[2, 24, 15, 248, 25, 4, 39, 216, 235, 0,
53, 72, 77, 42, 69, 107, 89, 46, 67, 1,
24, 92,9, 9, 9, 9, 181, 125]
#Str1[i - 1] ^= (Str1[i - 1] % 17 + Str1[i]) ^ 25
def dfs(index):
if index ==0:
for j in tmp:
print(chr(j),end='')
print()
else:
for i in range(255):
if (i^25)^(i%17+tmp[index])==enc[index-1]:
tmp[index-1]=i
dfs(index-1)
dfs(27)
#moectf{Art_i5_b14s7ing!!!!!}