Skip to content

Instantly share code, notes, and snippets.

@UserUnknownFactor

UserUnknownFactor/pgmmv_dec.py

Last active May 25, 2024 08:16
Show Gist options
  • Save UserUnknownFactor/6f18d2263b8aab21c5f29370bd9cb74c to your computer and use it in GitHub Desktop.
Save UserUnknownFactor/6f18d2263b8aab21c5f29370bd9cb74c to your computer and use it in GitHub Desktop.
Download ZIP
PGM MV file decryptor with a separate Twofish cryptography library
Raw
pgmmv_dec.py
try:
from twofish import Twofish # use github.com/blazepaws/python-twofish
except:
from pytwofish import Twofish # since the included implementation is slow
import struct
from typing import List
from base64 import b64decode
import os
import json
USE_NUMPY = True
try:
import numpy as np
except:
USE_NUMPY = False
OUTPUT_DIR = "decrypted"
CHECK_VALIDITY = True
IV = bytes.fromhex("A0 47 E9 3D 23 0A 4C 62 A7 44 B1 A4 EE 85 7F BA")
FIRST16_PNG = bytes.fromhex("89 50 4E 47 0D 0A 1A 0A 00 00 00 0D 49 48 44 52")
def xor_block_native(a, b):
return bytes(map(lambda v: v[0] ^ v[1], zip(a, b)))
def xor_block_numpy(a, b):
return np.bitwise_xor(np.frombuffer(a, dtype=np.uint8), np.frombuffer(b, dtype=np.uint8)).tobytes()
xor_block = xor_block_numpy if USE_NUMPY else xor_block_native
def cbc_process(iv, data, dec_func, block_size=16):
"""CBC (Cipher Block Chaining) decryption"""
assert len(data) % block_size == 0, f"Not a correct data length for Twofish, must be multiply of {block_size}"
last_block = iv
for i in range(0, len(data), block_size):
ct = data[i : i + block_size]
pt = xor_block(dec_func(ct), last_block)
last_block = ct
yield pt
def derive_key(data: bytes, key: bytes):
key = bytearray(key)
i = 0
h = len(data) - data[3] - 4
while h > 0:
t = (h ^ key[i]) & 0xff
key[i] = 1 if t < 1 else t
h //= 256
i += 1
return bytes(key)
def rotr32(x, n):
return (x >> n) | ((x << (32 - n)) & 0xFFFFFFFF)
def rotl32(x, n):
return ((x << n) & 0xFFFFFFFF) | (x >> (32 - n))
def bytesToWords(data: bytes) -> List[int]:
assert len(data) % 4 == 0
words_len = len(data) // 4
return list(struct.unpack(f"<{words_len}I", data))
def wordsToBytes(words: List[int]) -> bytes:
return bytes(struct.pack(f"<{len(words)}I", *words))
def weak_twofish_block_decrypt(words: List[int]):
"""Python code to simulate a strange key schedule.
In PGMM, if you try to use a key that is less than the key size of Twofish,
the key schedule will not work properly.
"""
assert len(words) == 4 # 16bytes
for _ in range(8):
words[2] = rotl32(words[2], 1) & 0xFFFFFFFF
words[3] = rotr32(words[3] & 0xFFFFFFFF, 1)
words[0] = rotl32(words[0], 1) & 0xFFFFFFFF
words[1] = rotr32(words[1] & 0xFFFFFFFF, 1)
[words[0], words[2]] = [words[2], words[0]]
[words[1], words[3]] = [words[3], words[1]]
return words
def decrypt(data: bytes, key: bytes | None, weak: bool):
if weak:
def block_dec(block):
return wordsToBytes(weak_twofish_block_decrypt(bytesToWords(block)))
else:
tf = Twofish(key)
def block_dec(block):
return tf.decrypt(block)
return b"".join(cbc_process(IV, data, block_dec))
def decrypt_pgmm_key(encrypted_key: bytes):
return decrypt(encrypted_key, None, True)
def decrypt_pgmm_resource(data: bytes, decrypted_key: bytes | None = None, weak: bool = True):
if weak:
return decrypt(data[4:], None, True)
else:
new_key = derive_key(data, decrypted_key)
return decrypt(data[4:], new_key, False)
def main():
encrypted_key = None
decrypted_key = None
weak = True
includes_res = os.path.isfile('.\\Resources\\data\\info.json')
not_includes_res = os.path.isfile('.\\data\\info.json')
if includes_res or not_includes_res:
json_path = '.\\Resources\\data\\info.json' if includes_res else '.\\data\\info.json'
else:
print("no info json found")
exit()
with open(json_path, 'r', encoding='utf-8') as f:
data = json.load(f)
encrypted_key = data.get("key")
if encrypted_key:
weak = False
decrypted_key = decrypt_pgmm_key(b64decode(encrypted_key))
print(f"key: {decrypted_key}")
extensions = ['.png', '.ogg', '.json', '.js']
current_dir = os.getcwd()
for root, _, files in os.walk(current_dir):
if OUTPUT_DIR in root: continue
for file in files:
if any(file.endswith(ext) for ext in extensions):
file_to_output = os.path.join(
current_dir, OUTPUT_DIR,
root.replace(current_dir, '').strip(os.sep), file
)
if (os.path.isfile(file_to_output)):
print(f"skipping existing file {file}")
continue
print(f"processing {file}")
file_to_decrypt = os.path.join(root, file)
with open(file_to_decrypt, 'rb') as f:
signature = f.read(4)
if signature[:3] == b'enc':
f.seek(0)
data = f.read()
decrypted_data = decrypt_pgmm_resource(data, decrypted_key, weak)
os.makedirs(os.path.dirname(file_to_output), exist_ok=True)
with open(file_to_output, 'wb') as output_file:
output_file.write(decrypted_data)
if CHECK_VALIDITY and file_to_decrypt.endswith('.png'):
assert FIRST16_PNG == decrypted_data[:16], f"Error in PNG: {decrypted_data[:16]}"
pass
if __name__ == "__main__":
main()
Raw
pytwofish.py
## twofish.py - pure Python implementation of the Twofish algorithm.
## Bjorn Edstrom <be@bjrn.se> 13 december 2007.
##
## Copyrights
## ==========
##
## This code is a derived from an implementation by Dr Brian Gladman
## (gladman@seven77.demon.co.uk) which is subject to the following license.
## This Python implementation is not subject to any other license.
##
##/* This is an independent implementation of the encryption algorithm: */
##/* */
##/* Twofish by Bruce Schneier and colleagues */
##/* */
##/* which is a candidate algorithm in the Advanced Encryption Standard */
##/* programme of the US National Institute of Standards and Technology. */
##/* */
##/* Copyright in this implementation is held by Dr B R Gladman but I */
##/* hereby give permission for its free direct or derivative use subject */
##/* to acknowledgment of its origin and compliance with any conditions */
##/* that the originators of t he algorithm place on its exploitation. */
##/* */
##/* My thanks to Doug Whiting and Niels Ferguson for comments that led */
##/* to improvements in this implementation. */
##/* */
##/* Dr Brian Gladman (gladman@seven77.demon.co.uk) 14th January 1999 */
##
## The above copyright notice must not be removed.
# pylint: disable-all
block_size = 16
key_size = 32
class Twofish:
def __init__(self, key=None):
"""Twofish."""
if key:
self.set_key(key)
def set_key(self, key):
"""Init."""
key_len = len(key)
if key_len not in [16, 24, 32]:
# XXX: add padding?
raise KeyError("key must be 16, 24 or 32 bytes")
if key_len % 4:
# XXX: add padding?
raise KeyError("key not a multiple of 4")
if key_len > 32:
# XXX: prune?
raise KeyError("key_len > 32")
self.context = TWI()
key_word32 = [0] * 32
i = 0
while key:
key_word32[i] = struct.unpack("<L", key[0:4])[0]
key = key[4:]
i += 1
set_key(self.context, key_word32, key_len)
def decrypt(self, block):
"""Decrypt blocks."""
if len(block) % 16:
raise ValueError("block size must be a multiple of 16")
plaintext = b''
while block:
a, b, c, d = struct.unpack("<4L", block[:16])
temp = [a, b, c, d]
decrypt(self.context, temp)
plaintext += struct.pack("<4L", *temp)
block = block[16:]
return plaintext
def encrypt(self, block):
"""Encrypt blocks."""
if len(block) % 16:
raise ValueError("block size must be a multiple of 16")
ciphertext = b''
while block:
a, b, c, d = struct.unpack("<4L", block[0:16])
temp = [a, b, c, d]
encrypt(self.context, temp)
ciphertext += struct.pack("<4L", *temp)
block = block[16:]
return ciphertext
def get_name(self):
"""Return the name of the cipher."""
return "Twofish"
def get_block_size(self):
"""Get cipher block size in bytes."""
return 16
def get_key_size(self):
"""Get cipher key size in bytes."""
return 32
#
# Private.
#
import struct
import sys
WORD_BIGENDIAN = 0
if sys.byteorder == 'big':
WORD_BIGENDIAN = 1
def rotr32(x, n):
return (x >> n) | ((x << (32 - n)) & 0xFFFFFFFF)
def rotl32(x, n):
return ((x << n) & 0xFFFFFFFF) | (x >> (32 - n))
def byteswap32(x):
return ((x & 0xff) << 24) | (((x >> 8) & 0xff) << 16) | \
(((x >> 16) & 0xff) << 8) | ((x >> 24) & 0xff)
class TWI:
def __init__(self):
self.k_len = 0 # word32
self.l_key = [0]*40 # word32
self.s_key = [0]*4 # word32
self.qt_gen = 0 # word32
self.q_tab = [[0]*256, [0]*256] # byte
self.mt_gen = 0 # word32
self.m_tab = [[0]*256, [0]*256, [0]*256, [0]*256] # word32
self.mk_tab = [[0]*256, [0]*256, [0]*256, [0]*256] # word32
def byte(x, n):
return (x >> (8 * n)) & 0xff
tab_5b = [0, 90, 180, 238]
tab_ef = [0, 238, 180, 90]
ror4 = [0, 8, 1, 9, 2, 10, 3, 11, 4, 12, 5, 13, 6, 14, 7, 15]
ashx = [0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 5, 14, 7]
qt0 = [[8, 1, 7, 13, 6, 15, 3, 2, 0, 11, 5, 9, 14, 12, 10, 4],
[2, 8, 11, 13, 15, 7, 6, 14, 3, 1, 9, 4, 0, 10, 12, 5]]
qt1 = [[14, 12, 11, 8, 1, 2, 3, 5, 15, 4, 10, 6, 7, 0, 9, 13],
[1, 14, 2, 11, 4, 12, 3, 7, 6, 13, 10, 5, 15, 9, 0, 8]]
qt2 = [[11, 10, 5, 14, 6, 13, 9, 0, 12, 8, 15, 3, 2, 4, 7, 1],
[4, 12, 7, 5, 1, 6, 9, 10, 0, 14, 13, 8, 2, 11, 3, 15]]
qt3 = [[13, 7, 15, 4, 1, 2, 6, 14, 9, 11, 3, 0, 8, 5, 12, 10],
[11, 9, 5, 1, 12, 3, 13, 14, 6, 4, 7, 15, 2, 0, 8, 10]]
def qp(n, x): # word32, byte
n %= 0x100000000
x %= 0x100
a0 = x >> 4
b0 = x & 15
a1 = a0 ^ b0
b1 = ror4[b0] ^ ashx[a0]
a2 = qt0[n][a1]
b2 = qt1[n][b1]
a3 = a2 ^ b2
b3 = ror4[b2] ^ ashx[a2]
a4 = qt2[n][a3]
b4 = qt3[n][b3]
return (b4 << 4) | a4
def gen_qtab(pkey):
for i in range(256):
pkey.q_tab[0][i] = qp(0, i)
pkey.q_tab[1][i] = qp(1, i)
def gen_mtab(pkey):
for i in range(256):
f01 = pkey.q_tab[1][i]
f01 = pkey.q_tab[1][i]
f5b = ((f01) ^ ((f01) >> 2) ^ tab_5b[(f01) & 3])
fef = ((f01) ^ ((f01) >> 1) ^ ((f01) >> 2) ^ tab_ef[(f01) & 3])
pkey.m_tab[0][i] = f01 + (f5b << 8) + (fef << 16) + (fef << 24)
pkey.m_tab[2][i] = f5b + (fef << 8) + (f01 << 16) + (fef << 24)
f01 = pkey.q_tab[0][i]
f5b = ((f01) ^ ((f01) >> 2) ^ tab_5b[(f01) & 3])
fef = ((f01) ^ ((f01) >> 1) ^ ((f01) >> 2) ^ tab_ef[(f01) & 3])
pkey.m_tab[1][i] = fef + (fef << 8) + (f5b << 16) + (f01 << 24)
pkey.m_tab[3][i] = f5b + (f01 << 8) + (fef << 16) + (f5b << 24)
def gen_mk_tab(pkey, key):
if pkey.k_len == 2:
for i in range(256):
by = i % 0x100
pkey.mk_tab[0][i] = pkey.m_tab[0][pkey.q_tab[0][pkey.q_tab[0][by] ^ byte(key[1],0)] ^ byte(key[0],0)]
pkey.mk_tab[1][i] = pkey.m_tab[1][pkey.q_tab[0][pkey.q_tab[1][by] ^ byte(key[1],1)] ^ byte(key[0],1)]
pkey.mk_tab[2][i] = pkey.m_tab[2][pkey.q_tab[1][pkey.q_tab[0][by] ^ byte(key[1],2)] ^ byte(key[0],2)]
pkey.mk_tab[3][i] = pkey.m_tab[3][pkey.q_tab[1][pkey.q_tab[1][by] ^ byte(key[1],3)] ^ byte(key[0],3)]
if pkey.k_len == 3:
for i in range(256):
by = i % 0x100
pkey.mk_tab[0][i] = pkey.m_tab[0][pkey.q_tab[0][pkey.q_tab[0][pkey.q_tab[1][by] ^ byte(key[2], 0)] ^ byte(key[1], 0)] ^ byte(key[0], 0)]
pkey.mk_tab[1][i] = pkey.m_tab[1][pkey.q_tab[0][pkey.q_tab[1][pkey.q_tab[1][by] ^ byte(key[2], 1)] ^ byte(key[1], 1)] ^ byte(key[0], 1)]
pkey.mk_tab[2][i] = pkey.m_tab[2][pkey.q_tab[1][pkey.q_tab[0][pkey.q_tab[0][by] ^ byte(key[2], 2)] ^ byte(key[1], 2)] ^ byte(key[0], 2)]
pkey.mk_tab[3][i] = pkey.m_tab[3][pkey.q_tab[1][pkey.q_tab[1][pkey.q_tab[0][by] ^ byte(key[2], 3)] ^ byte(key[1], 3)] ^ byte(key[0], 3)]
if pkey.k_len == 4:
for i in range(256):
by = i % 0x100
pkey.mk_tab[0][i] = pkey.m_tab[0][pkey.q_tab[0][pkey.q_tab[0][pkey.q_tab[1][pkey.q_tab[1][by] ^ byte(key[3], 0)] ^ byte(key[2], 0)] ^ byte(key[1], 0)] ^ byte(key[0], 0)]
pkey.mk_tab[1][i] = pkey.m_tab[1][pkey.q_tab[0][pkey.q_tab[1][pkey.q_tab[1][pkey.q_tab[0][by] ^ byte(key[3], 1)] ^ byte(key[2], 1)] ^ byte(key[1], 1)] ^ byte(key[0], 1)]
pkey.mk_tab[2][i] = pkey.m_tab[2][pkey.q_tab[1][pkey.q_tab[0][pkey.q_tab[0][pkey.q_tab[0][by] ^ byte(key[3], 2)] ^ byte(key[2], 2)] ^ byte(key[1], 2)] ^ byte(key[0], 2)]
pkey.mk_tab[3][i] = pkey.m_tab[3][pkey.q_tab[1][pkey.q_tab[1][pkey.q_tab[0][pkey.q_tab[1][by] ^ byte(key[3], 3)] ^ byte(key[2], 3)] ^ byte(key[1], 3)] ^ byte(key[0], 3)]
def h_fun(pkey, x, key):
b0 = byte(x, 0)
b1 = byte(x, 1)
b2 = byte(x, 2)
b3 = byte(x, 3)
if pkey.k_len >= 4:
b0 = pkey.q_tab[1][b0] ^ byte(key[3], 0)
b1 = pkey.q_tab[0][b1] ^ byte(key[3], 1)
b2 = pkey.q_tab[0][b2] ^ byte(key[3], 2)
b3 = pkey.q_tab[1][b3] ^ byte(key[3], 3)
if pkey.k_len >= 3:
b0 = pkey.q_tab[1][b0] ^ byte(key[2], 0)
b1 = pkey.q_tab[1][b1] ^ byte(key[2], 1)
b2 = pkey.q_tab[0][b2] ^ byte(key[2], 2)
b3 = pkey.q_tab[0][b3] ^ byte(key[2], 3)
if pkey.k_len >= 2:
b0 = pkey.q_tab[0][pkey.q_tab[0][b0] ^ byte(key[1], 0)] ^ byte(key[0], 0)
b1 = pkey.q_tab[0][pkey.q_tab[1][b1] ^ byte(key[1], 1)] ^ byte(key[0], 1)
b2 = pkey.q_tab[1][pkey.q_tab[0][b2] ^ byte(key[1], 2)] ^ byte(key[0], 2)
b3 = pkey.q_tab[1][pkey.q_tab[1][b3] ^ byte(key[1], 3)] ^ byte(key[0], 3)
return pkey.m_tab[0][b0] ^ pkey.m_tab[1][b1] ^ pkey.m_tab[2][b2] ^ pkey.m_tab[3][b3]
def mds_rem(p0, p1):
i, t, u = 0, 0, 0
for i in range(8):
t = p1 >> 24
p1 = ((p1 << 8) & 0xffffffff) | (p0 >> 24)
p0 = (p0 << 8) & 0xffffffff
u = (t << 1) & 0xffffffff
if t & 0x80:
u ^= 0x0000014d
p1 ^= t ^ ((u << 16) & 0xffffffff)
u ^= (t >> 1)
if t & 0x01:
u ^= 0x0000014d >> 1
p1 ^= ((u << 24) & 0xffffffff) | ((u << 8) & 0xffffffff)
return p1
def set_key(pkey, in_key, key_len):
pkey.qt_gen = 0
if not pkey.qt_gen:
gen_qtab(pkey)
pkey.qt_gen = 1
pkey.mt_gen = 0
if not pkey.mt_gen:
gen_mtab(pkey)
pkey.mt_gen = 1
pkey.k_len = (key_len * 8) // 64
a = 0
b = 0
me_key = [0,0,0,0]
mo_key = [0,0,0,0]
for i in range(pkey.k_len):
if WORD_BIGENDIAN:
a = byteswap32(in_key[i + 1])
me_key[i] = a
b = byteswap32(in_key[i + i + 1])
else:
a = in_key[i + i]
me_key[i] = a
b = in_key[i + i + 1]
mo_key[i] = b
pkey.s_key[pkey.k_len - i - 1] = mds_rem(a, b)
for i in range(0, 40, 2):
a = (0x01010101 * i) % 0x100000000
b = (a + 0x01010101) % 0x100000000
a = h_fun(pkey, a, me_key)
b = rotl32(h_fun(pkey, b, mo_key), 8)
pkey.l_key[i] = (a + b) % 0x100000000
pkey.l_key[i + 1] = rotl32((a + 2 * b) % 0x100000000, 9)
gen_mk_tab(pkey, pkey.s_key)
def encrypt(pkey, in_blk):
blk = [0, 0, 0, 0]
if WORD_BIGENDIAN:
blk[0] = byteswap32(in_blk[0]) ^ pkey.l_key[0]
blk[1] = byteswap32(in_blk[1]) ^ pkey.l_key[1]
blk[2] = byteswap32(in_blk[2]) ^ pkey.l_key[2]
blk[3] = byteswap32(in_blk[3]) ^ pkey.l_key[3]
else:
blk[0] = in_blk[0] ^ pkey.l_key[0]
blk[1] = in_blk[1] ^ pkey.l_key[1]
blk[2] = in_blk[2] ^ pkey.l_key[2]
blk[3] = in_blk[3] ^ pkey.l_key[3]
for i in range(8):
t1 = ( pkey.mk_tab[0][byte(blk[1],3)] ^ pkey.mk_tab[1][byte(blk[1],0)] ^ pkey.mk_tab[2][byte(blk[1],1)] ^ pkey.mk_tab[3][byte(blk[1],2)] )
t0 = ( pkey.mk_tab[0][byte(blk[0],0)] ^ pkey.mk_tab[1][byte(blk[0],1)] ^ pkey.mk_tab[2][byte(blk[0],2)] ^ pkey.mk_tab[3][byte(blk[0],3)] )
blk[2] = rotr32(blk[2] ^ ((t0 + t1 + pkey.l_key[4 * (i) + 8]) % 0x100000000), 1)
blk[3] = rotl32(blk[3], 1) ^ ((t0 + 2 * t1 + pkey.l_key[4 * (i) + 9]) % 0x100000000)
t1 = ( pkey.mk_tab[0][byte(blk[3],3)] ^ pkey.mk_tab[1][byte(blk[3],0)] ^ pkey.mk_tab[2][byte(blk[3],1)] ^ pkey.mk_tab[3][byte(blk[3],2)] )
t0 = ( pkey.mk_tab[0][byte(blk[2],0)] ^ pkey.mk_tab[1][byte(blk[2],1)] ^ pkey.mk_tab[2][byte(blk[2],2)] ^ pkey.mk_tab[3][byte(blk[2],3)] )
blk[0] = rotr32(blk[0] ^ ((t0 + t1 + pkey.l_key[4 * (i) + 10]) % 0x100000000), 1)
blk[1] = rotl32(blk[1], 1) ^ ((t0 + 2 * t1 + pkey.l_key[4 * (i) + 11]) % 0x100000000)
if WORD_BIGENDIAN:
in_blk[0] = byteswap32(blk[2] ^ pkey.l_key[4])
in_blk[1] = byteswap32(blk[3] ^ pkey.l_key[5])
in_blk[2] = byteswap32(blk[0] ^ pkey.l_key[6])
in_blk[3] = byteswap32(blk[1] ^ pkey.l_key[7])
else:
in_blk[0] = blk[2] ^ pkey.l_key[4]
in_blk[1] = blk[3] ^ pkey.l_key[5]
in_blk[2] = blk[0] ^ pkey.l_key[6]
in_blk[3] = blk[1] ^ pkey.l_key[7]
return
def decrypt(pkey, in_blk):
blk = [0, 0, 0, 0]
if WORD_BIGENDIAN:
blk[0] = byteswap32(in_blk[0]) ^ pkey.l_key[4]
blk[1] = byteswap32(in_blk[1]) ^ pkey.l_key[5]
blk[2] = byteswap32(in_blk[2]) ^ pkey.l_key[6]
blk[3] = byteswap32(in_blk[3]) ^ pkey.l_key[7]
else:
blk[0] = in_blk[0] ^ pkey.l_key[4]
blk[1] = in_blk[1] ^ pkey.l_key[5]
blk[2] = in_blk[2] ^ pkey.l_key[6]
blk[3] = in_blk[3] ^ pkey.l_key[7]
for i in range(7, -1, -1):
t1 = ( pkey.mk_tab[0][byte(blk[1],3)] ^ pkey.mk_tab[1][byte(blk[1],0)] ^ pkey.mk_tab[2][byte(blk[1],1)] ^ pkey.mk_tab[3][byte(blk[1],2)] )
t0 = ( pkey.mk_tab[0][byte(blk[0],0)] ^ pkey.mk_tab[1][byte(blk[0],1)] ^ pkey.mk_tab[2][byte(blk[0],2)] ^ pkey.mk_tab[3][byte(blk[0],3)] )
blk[2] = rotl32(blk[2], 1) ^ ((t0 + t1 + pkey.l_key[4 * (i) + 10]) % 0x100000000)
blk[3] = rotr32(blk[3] ^ ((t0 + 2 * t1 + pkey.l_key[4 * (i) + 11]) % 0x100000000), 1)
t1 = ( pkey.mk_tab[0][byte(blk[3],3)] ^ pkey.mk_tab[1][byte(blk[3],0)] ^ pkey.mk_tab[2][byte(blk[3],1)] ^ pkey.mk_tab[3][byte(blk[3],2)] )
t0 = ( pkey.mk_tab[0][byte(blk[2],0)] ^ pkey.mk_tab[1][byte(blk[2],1)] ^ pkey.mk_tab[2][byte(blk[2],2)] ^ pkey.mk_tab[3][byte(blk[2],3)] )
blk[0] = rotl32(blk[0], 1) ^ ((t0 + t1 + pkey.l_key[4 * (i) + 8]) % 0x100000000)
blk[1] = rotr32(blk[1] ^ ((t0 + 2 * t1 + pkey.l_key[4 * (i) + 9]) % 0x100000000), 1)
if WORD_BIGENDIAN:
in_blk[0] = byteswap32(blk[2] ^ pkey.l_key[0])
in_blk[1] = byteswap32(blk[3] ^ pkey.l_key[1])
in_blk[2] = byteswap32(blk[0] ^ pkey.l_key[2])
in_blk[3] = byteswap32(blk[1] ^ pkey.l_key[3])
else:
in_blk[0] = blk[2] ^ pkey.l_key[0]
in_blk[1] = blk[3] ^ pkey.l_key[1]
in_blk[2] = blk[0] ^ pkey.l_key[2]
in_blk[3] = blk[1] ^ pkey.l_key[3]
return
if __name__ == "__main__":
__testkey = b'\xD4\x3B\xB7\x55\x6E\xA3\x2E\x46\xF2\xA2\x82\xB7\xD4\x5B\x4E\x0D\x57\xFF\x73\x9D\x4D\xC9\x2C\x1B\xD7\xFC\x01\x70\x0C\xC8\x21\x6F'
__testdat = b'\x90\xAF\xE9\x1B\xB2\x88\x54\x4F\x2C\x32\xDC\x23\x9B\x26\x35\xE6'
__test_source = b'l\xb4V\x1c@\xbf\n\x97\x05\x93\x1c\xb6\xd4\x08\xe7\xfa'
assert __test_source == Twofish(__testkey).encrypt(__testdat)
assert __testdat == Twofish(__testkey).decrypt(__test_source)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment