Skip to content

Instantly share code, notes, and snippets.

@CreateRemoteThread
Created April 5, 2017 13:43
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save CreateRemoteThread/1bf2c38758c1b5e9f90122c8fea29c83 to your computer and use it in GitHub Desktop.
Save CreateRemoteThread/1bf2c38758c1b5e9f90122c8fea29c83 to your computer and use it in GitHub Desktop.
#!/usr/bin/python
# 21c25411
# 32c0a748
# 4035d6a1
# 0e3bdcb0
# f9730a6d
# b34eec73
# b8520dac
# e2e28524
next_key = [ord('W'),0x11,0x54,0xc2,0x21, 0x48, 0xa7, 0xc0, 0x32, 0xa1, 0xd6, 0x35, 0x40, 0xb0, 0xdc, 0x3b, 0xe0, 0x6d, 0x0a, 0x73, 0xf9, 0x73, 0xec, 0x4e, 0xb3, 0xac, 0x0d, 0x52, 0xb8, 0x24, 0x85, 0xe2, 0xe2]
def solve_for_one_even(next_key,last_key):
for i in range(0,255):
if (i + last_key) % 256 == next_key:
return i
def solve_for_one_odd(next_key,last_key):
for i in range(0,255):
if (i - last_key) % 256 == next_key:
return i
out = ""
for i in range(1,len(next_key)):
if next_key[i-1] % 2 == 0:
n = solve_for_one_even(next_key[i],next_key[i-1])
else:
n = solve_for_one_odd(next_key[i],next_key[i-1])
out += chr(n)
print out
magic_key = [ 0xDEADBEEF, 0x0FF6FEAFE, 0x0CDAF4DB6, 0x8D9A9B17, 0x83A147A7, 0x7AD24DCA, 0x0C99CA1B9, 0x71CEAC15, 0x932C2931 ]
currentKey = 0xDEADBEEF
for key in range(1,len(magic_key)):
currentKey = magic_key[key] ^ magic_key[key-1]
print "%08x" % currentKey
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment