随便写的答辩代码不要太较真
SM4主体
class SM4():
def __init__(self, key):
if len(key) != 16:
raise ValueError("SM4 key must be length of 16. ")
self.key_r = self.key_gen(key)
def enc(self, text):
key_r = self.key_r
text = [int.from_bytes(text[4*i: 4*i+4], 'big') for i in range(4)]
for i in range(32):
B = text[1] ^ text[2] ^ text[3] ^ key_r[i]
C = self.s_box(B)
tmp = text[0] ^ C ^ self.L_shift(C, 2) ^ self.L_shift(C, 10) ^ self.L_shift(C, 18) ^ self.L_shift(C, 24)
text = text[1:] + [tmp]
text = text[::-1]
res = b''
for i in range(4):
res += text[i].to_bytes(4, 'big')
return res
def dec(self, text):
key_r = self.key_r[::-1]
text = [int.from_bytes(text[4*i: 4*i+4], 'big') for i in range(4)]
for i in range(32):
B = text[1] ^ text[2] ^ text[3] ^ key_r[i]
C = self.s_box(B)
tmp = text[0] ^ C ^ self.L_shift(C, 2) ^ self.L_shift(C, 10) ^ self.L_shift(C, 18) ^ self.L_shift(C, 24)
text = text[1:] + [tmp]
text = text[::-1]
res = b''
for i in range(4):
res += text[i].to_bytes(4, 'big')
return res
def key_gen(self, key):
FK = [0xa3b1bac6, 0x56aa3350, 0x677d9197, 0xb27022dc]
CK = [0x00070e15, 0x1c232a31, 0x383f464d, 0x545b6269, 0x70777e85, 0x8c939aa1, 0xa8afb6bd, 0xc4cbd2d9,
0xe0e7eef5, 0xfc030a11, 0x181f262d, 0x343b4249, 0x50575e65, 0x6c737a81, 0x888f969d, 0xa4abb2b9,
0xc0c7ced5, 0xdce3eaf1, 0xf8ff060d, 0x141b2229, 0x30373e45, 0x4c535a61, 0x686f767d, 0x848b9299,
0xa0a7aeb5, 0xbcc3cad1, 0xd8dfe6ed, 0xf4fb0209, 0x10171e25, 0x2c333a41, 0x484f565d, 0x646b7279]
MK = [int.from_bytes(key[i*4:i*4+4], 'big') for i in range(4)]
K = [MK[i] ^ FK[i] for i in range(4)]
key_r = [0] * 32
for i in range(32):
B = K[1] ^ K[2] ^ K[3] ^ CK[i]
C = self.s_box(B)
D = C ^ self.L_shift(C, 13) ^ self.L_shift(C, 23)
key_r[i] = K[0] ^ D
K = K[1:] + [key_r[i]]
return key_r
@staticmethod
def L_shift(n, l):
return ((n << l) | (n >> (32-l))) & 0xFFFFFFFF
@staticmethod
def s_box(n):
Box = [ 0xd6, 0x90, 0xe9, 0xfe, 0xcc, 0xe1, 0x3d, 0xb7, 0x16, 0xb6, 0x14, 0xc2, 0x28, 0xfb, 0x2c, 0x05,
0x2b, 0x67, 0x9a, 0x76, 0x2a, 0xbe, 0x04, 0xc3, 0xaa, 0x44, 0x13, 0x26, 0x49, 0x86, 0x06, 0x99,
0x9c, 0x42, 0x50, 0xf4, 0x91, 0xef, 0x98, 0x7a, 0x33, 0x54, 0x0b, 0x43, 0xed, 0xcf, 0xac, 0x62,
0xe4, 0xb3, 0x1c, 0xa9, 0xc9, 0x08, 0xe8, 0x95, 0x80, 0xdf, 0x94, 0xfa, 0x75, 0x8f, 0x3f, 0xa6,
0x47, 0x07, 0xa7, 0xfc, 0xf3, 0x73, 0x17, 0xba, 0x83, 0x59, 0x3c, 0x19, 0xe6, 0x85, 0x4f, 0xa8,
0x68, 0x6b, 0x81, 0xb2, 0x71, 0x64, 0xda, 0x8b, 0xf8, 0xeb, 0x0f, 0x4b, 0x70, 0x56, 0x9d, 0x35,
0x1e, 0x24, 0x0e, 0x5e, 0x63, 0x58, 0xd1, 0xa2, 0x25, 0x22, 0x7c, 0x3b, 0x01, 0x21, 0x78, 0x87,
0xd4, 0x00, 0x46, 0x57, 0x9f, 0xd3, 0x27, 0x52, 0x4c, 0x36, 0x02, 0xe7, 0xa0, 0xc4, 0xc8, 0x9e,
0xea, 0xbf, 0x8a, 0xd2, 0x40, 0xc7, 0x38, 0xb5, 0xa3, 0xf7, 0xf2, 0xce, 0xf9, 0x61, 0x15, 0xa1,
0xe0, 0xae, 0x5d, 0xa4, 0x9b, 0x34, 0x1a, 0x55, 0xad, 0x93, 0x32, 0x30, 0xf5, 0x8c, 0xb1, 0xe3,
0x1d, 0xf6, 0xe2, 0x2e, 0x82, 0x66, 0xca, 0x60, 0xc0, 0x29, 0x23, 0xab, 0x0d, 0x53, 0x4e, 0x6f,
0xd5, 0xdb, 0x37, 0x45, 0xde, 0xfd, 0x8e, 0x2f, 0x03, 0xff, 0x6a, 0x72, 0x6d, 0x6c, 0x5b, 0x51,
0x8d, 0x1b, 0xaf, 0x92, 0xbb, 0xdd, 0xbc, 0x7f, 0x11, 0xd9, 0x5c, 0x41, 0x1f, 0x10, 0x5a, 0xd8,
0x0a, 0xc1, 0x31, 0x88, 0xa5, 0xcd, 0x7b, 0xbd, 0x2d, 0x74, 0xd0, 0x12, 0xb8, 0xe5, 0xb4, 0xb0,
0x89, 0x69, 0x97, 0x4a, 0x0c, 0x96, 0x77, 0x7e, 0x65, 0xb9, 0xf1, 0x09, 0xc5, 0x6e, 0xc6, 0x84,
0x18, 0xf0, 0x7d, 0xec, 0x3a, 0xdc, 0x4d, 0x20, 0x79, 0xee, 0x5f, 0x3e, 0xd7, 0xcb, 0x39, 0x48]
res = b''
for i in list(n.to_bytes(4, 'big')):
res += Box[i].to_bytes(1, 'big')
return int.from_bytes(res, 'big')
验证
key = bytes.fromhex("0123456789ABCDEFFEDCBA9876543210")
sm4 = SM4(key)
# 准确性测试
plaintext = bytes.fromhex("0123456789ABCDEFFEDCBA9876543210")
for i in range(1000000):
ciphertext = sm4.enc(plaintext)
plaintext = ciphertext
print(ciphertext.hex())
扩散性
# 扩散性测试
m1 = bytes.fromhex("00000000000000000000000000000000")
m2 = bytes.fromhex("00000000000000000000000000000001")
c1 = sm4.enc(m1)
c2 = sm4.enc(m2)
print(c1.hex())
print(c2.hex())
随机性
这里用的是CBC模式，用的书上P133的验证方法，第一个过了第二个没过
# CBC实现
def pad(m):
return m + b'\x00' * (16 - len(m) % 16)
def bytes_xor(x1, x2):
x = b''
for i in range(16):
x += (x1[1]^x2[1]).to_bytes(1, 'big')
return x
def CBC(sm4, m, IV):
m = pad(m)
l = len(m)//16
mlist = [m[i * 16:i * 16 + 16] for i in range(l)]
clist = [IV]
for mm in mlist:
clist.append(sm4.enc(bytes_xor(mm, clist[-1])))
for c in clist:
if len(c) != 16:
print(1)
c = b''.join(clist[1:])
return c
# 随机性测试
t1, t2 = 0, 0
for i in range(1000):
m = os.urandom(2500)
IV = os.urandom(16)
c = CBC(sm4, m, IV)
count0 = bin(int.from_bytes(c, 'big'))[2:20002].count('0')
if count0 < 10346 and count0 > 9654:
t1+=1
nlist = [0]*16
for j in c[:20000]:
nlist[j>>4]+=1
nlist[j%16]+=1
X = sum([ni**2 for ni in nlist])*16/5000 - 5000
if X > 1.03 and X < 57.4:
t2+=1
print(f'测试1通过率为{t1/10}%')
print(f'测试2通过率为{t2/10}%')
完整代码
import os
class SM4():
def __init__(self, key):
if len(key) != 16:
raise ValueError("SM4 key must be length of 16. ")
self.key_r = self.key_gen(key)
def enc(self, text):
key_r = self.key_r
text = [int.from_bytes(text[4*i: 4*i+4], 'big') for i in range(4)]
for i in range(32):
B = text[1] ^ text[2] ^ text[3] ^ key_r[i]
C = self.s_box(B)
tmp = text[0] ^ C ^ self.L_shift(C, 2) ^ self.L_shift(C, 10) ^ self.L_shift(C, 18) ^ self.L_shift(C, 24)
text = text[1:] + [tmp]
text = text[::-1]
res = b''
for i in range(4):
res += text[i].to_bytes(4, 'big')
return res
def dec(self, text):
key_r = self.key_r[::-1]
text = [int.from_bytes(text[4*i: 4*i+4], 'big') for i in range(4)]
for i in range(32):
B = text[1] ^ text[2] ^ text[3] ^ key_r[i]
C = self.s_box(B)
tmp = text[0] ^ C ^ self.L_shift(C, 2) ^ self.L_shift(C, 10) ^ self.L_shift(C, 18) ^ self.L_shift(C, 24)
text = text[1:] + [tmp]
text = text[::-1]
res = b''
for i in range(4):
res += text[i].to_bytes(4, 'big')
return res
def key_gen(self, key):
FK = [0xa3b1bac6, 0x56aa3350, 0x677d9197, 0xb27022dc]
CK = [0x00070e15, 0x1c232a31, 0x383f464d, 0x545b6269, 0x70777e85, 0x8c939aa1, 0xa8afb6bd, 0xc4cbd2d9,
0xe0e7eef5, 0xfc030a11, 0x181f262d, 0x343b4249, 0x50575e65, 0x6c737a81, 0x888f969d, 0xa4abb2b9,
0xc0c7ced5, 0xdce3eaf1, 0xf8ff060d, 0x141b2229, 0x30373e45, 0x4c535a61, 0x686f767d, 0x848b9299,
0xa0a7aeb5, 0xbcc3cad1, 0xd8dfe6ed, 0xf4fb0209, 0x10171e25, 0x2c333a41, 0x484f565d, 0x646b7279]
MK = [int.from_bytes(key[i*4:i*4+4], 'big') for i in range(4)]
K = [MK[i] ^ FK[i] for i in range(4)]
key_r = [0] * 32
for i in range(32):
B = K[1] ^ K[2] ^ K[3] ^ CK[i]
C = self.s_box(B)
D = C ^ self.L_shift(C, 13) ^ self.L_shift(C, 23)
key_r[i] = K[0] ^ D
K = K[1:] + [key_r[i]]
return key_r
@staticmethod
def L_shift(n, l):
return ((n << l) | (n >> (32-l))) & 0xFFFFFFFF
@staticmethod
def s_box(n):
Box = [ 0xd6, 0x90, 0xe9, 0xfe, 0xcc, 0xe1, 0x3d, 0xb7, 0x16, 0xb6, 0x14, 0xc2, 0x28, 0xfb, 0x2c, 0x05,
0x2b, 0x67, 0x9a, 0x76, 0x2a, 0xbe, 0x04, 0xc3, 0xaa, 0x44, 0x13, 0x26, 0x49, 0x86, 0x06, 0x99,
0x9c, 0x42, 0x50, 0xf4, 0x91, 0xef, 0x98, 0x7a, 0x33, 0x54, 0x0b, 0x43, 0xed, 0xcf, 0xac, 0x62,
0xe4, 0xb3, 0x1c, 0xa9, 0xc9, 0x08, 0xe8, 0x95, 0x80, 0xdf, 0x94, 0xfa, 0x75, 0x8f, 0x3f, 0xa6,
0x47, 0x07, 0xa7, 0xfc, 0xf3, 0x73, 0x17, 0xba, 0x83, 0x59, 0x3c, 0x19, 0xe6, 0x85, 0x4f, 0xa8,
0x68, 0x6b, 0x81, 0xb2, 0x71, 0x64, 0xda, 0x8b, 0xf8, 0xeb, 0x0f, 0x4b, 0x70, 0x56, 0x9d, 0x35,
0x1e, 0x24, 0x0e, 0x5e, 0x63, 0x58, 0xd1, 0xa2, 0x25, 0x22, 0x7c, 0x3b, 0x01, 0x21, 0x78, 0x87,
0xd4, 0x00, 0x46, 0x57, 0x9f, 0xd3, 0x27, 0x52, 0x4c, 0x36, 0x02, 0xe7, 0xa0, 0xc4, 0xc8, 0x9e,
0xea, 0xbf, 0x8a, 0xd2, 0x40, 0xc7, 0x38, 0xb5, 0xa3, 0xf7, 0xf2, 0xce, 0xf9, 0x61, 0x15, 0xa1,
0xe0, 0xae, 0x5d, 0xa4, 0x9b, 0x34, 0x1a, 0x55, 0xad, 0x93, 0x32, 0x30, 0xf5, 0x8c, 0xb1, 0xe3,
0x1d, 0xf6, 0xe2, 0x2e, 0x82, 0x66, 0xca, 0x60, 0xc0, 0x29, 0x23, 0xab, 0x0d, 0x53, 0x4e, 0x6f,
0xd5, 0xdb, 0x37, 0x45, 0xde, 0xfd, 0x8e, 0x2f, 0x03, 0xff, 0x6a, 0x72, 0x6d, 0x6c, 0x5b, 0x51,
0x8d, 0x1b, 0xaf, 0x92, 0xbb, 0xdd, 0xbc, 0x7f, 0x11, 0xd9, 0x5c, 0x41, 0x1f, 0x10, 0x5a, 0xd8,
0x0a, 0xc1, 0x31, 0x88, 0xa5, 0xcd, 0x7b, 0xbd, 0x2d, 0x74, 0xd0, 0x12, 0xb8, 0xe5, 0xb4, 0xb0,
0x89, 0x69, 0x97, 0x4a, 0x0c, 0x96, 0x77, 0x7e, 0x65, 0xb9, 0xf1, 0x09, 0xc5, 0x6e, 0xc6, 0x84,
0x18, 0xf0, 0x7d, 0xec, 0x3a, 0xdc, 0x4d, 0x20, 0x79, 0xee, 0x5f, 0x3e, 0xd7, 0xcb, 0x39, 0x48]
res = b''
for i in list(n.to_bytes(4, 'big')):
res += Box[i].to_bytes(1, 'big')
return int.from_bytes(res, 'big')
key = bytes.fromhex("0123456789ABCDEFFEDCBA9876543210")
sm4 = SM4(key)
# 准确性测试
plaintext = bytes.fromhex("0123456789ABCDEFFEDCBA9876543210")
for i in range(1000000):
ciphertext = sm4.enc(plaintext)
plaintext = ciphertext
print(ciphertext.hex())
# 扩散性测试
m1 = bytes.fromhex("00000000000000000000000000000000")
m2 = bytes.fromhex("00000000000000000000000000000001")
c1 = sm4.enc(m1)
c2 = sm4.enc(m2)
print(c1.hex())
print(c2.hex())
# CBC模式
def pad(m):
return m + b'\x00' * (16 - len(m) % 16)
def bytes_xor(x1, x2):
x = b''
for i in range(16):
x += (x1[1]^x2[1]).to_bytes(1, 'big')
return x
def CBC(sm4, m, IV):
m = pad(m)
l = len(m)//16
mlist = [m[i * 16:i * 16 + 16] for i in range(l)]
clist = [IV]
for mm in mlist:
clist.append(sm4.enc(bytes_xor(mm, clist[-1])))
for c in clist:
if len(c) != 16:
print(1)
c = b''.join(clist[1:])
return c
# 随机性测试
t1, t2 = 0, 0
for i in range(1000):
m = os.urandom(2500)
IV = os.urandom(16)
c = CBC(sm4, m, IV)
count0 = bin(int.from_bytes(c, 'big'))[2:20002].count('0')
if count0 < 10346 and count0 > 9654:
t1+=1
nlist = [0]*16
for j in c[:20000]:
nlist[j>>4]+=1
nlist[j%16]+=1
X = sum([ni**2 for ni in nlist])*16/5000 - 5000
if X > 1.03 and X < 57.4:
t2+=1
print(f'测试1通过率为{t1/10}%')
print(f'测试2通过率为{t2/10}%')
运行结果
595298c7c6fd271f0402f804c33d3f66
2677f46b09c122cc975533105bd4a22a
4e595bf03f23bd10329baf5698e898ec
测试1通过率为100.0%
测试2通过率为0.6%
2万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
