圆月山庄资源网 Design By www.vgjia.com
SM3是中华人民共和国政府采用的一种密码散列函数标准,由国家密码管理局于2010年12月17日发布。主要用于报告文件数字签名及验证。
Python3代码如下:
from math import ceil ############################################################################## # # 国产SM3加密算法 # ############################################################################## IV = "7380166f 4914b2b9 172442d7 da8a0600 a96f30bc 163138aa e38dee4d b0fb0e4e" IV = int(IV.replace(" ", ""), 16) a = [] for i in range(0, 8): a.append(0) a[i] = (IV ((7 - i) * 32)) & 0xFFFFFFFF IV = a def out_hex(list1): for i in list1: print("%08x" % i) print("\n") def rotate_left(a, k): k = k % 32 return ((a << k) & 0xFFFFFFFF) | ((a & 0xFFFFFFFF) (32 - k)) T_j = [] for i in range(0, 16): T_j.append(0) T_j[i] = 0x79cc4519 for i in range(16, 64): T_j.append(0) T_j[i] = 0x7a879d8a def FF_j(X, Y, Z, j): if 0 <= j and j < 16: ret = X ^ Y ^ Z elif 16 <= j and j < 64: ret = (X & Y) | (X & Z) | (Y & Z) return ret def GG_j(X, Y, Z, j): if 0 <= j and j < 16: ret = X ^ Y ^ Z elif 16 <= j and j < 64: # ret = (X | Y) & ((2 ** 32 - 1 - X) | Z) ret = (X & Y) | ((~ X) & Z) return ret def P_0(X): return X ^ (rotate_left(X, 9)) ^ (rotate_left(X, 17)) def P_1(X): return X ^ (rotate_left(X, 15)) ^ (rotate_left(X, 23)) def CF(V_i, B_i): W = [] for i in range(16): weight = 0x1000000 data = 0 for k in range(i * 4, (i + 1) * 4): data = data + B_i[k] * weight weight = int(weight / 0x100) W.append(data) for j in range(16, 68): W.append(0) W[j] = P_1(W[j - 16] ^ W[j - 9] ^ (rotate_left(W[j - 3], 15))) ^ (rotate_left(W[j - 13], 7)) ^ W[j - 6] str1 = "%08x" % W[j] W_1 = [] for j in range(0, 64): W_1.append(0) W_1[j] = W[j] ^ W[j + 4] str1 = "%08x" % W_1[j] A, B, C, D, E, F, G, H = V_i """ print "00", out_hex([A, B, C, D, E, F, G, H]) """ for j in range(0, 64): SS1 = rotate_left(((rotate_left(A, 12)) + E + (rotate_left(T_j[j], j))) & 0xFFFFFFFF, 7) SS2 = SS1 ^ (rotate_left(A, 12)) TT1 = (FF_j(A, B, C, j) + D + SS2 + W_1[j]) & 0xFFFFFFFF TT2 = (GG_j(E, F, G, j) + H + SS1 + W[j]) & 0xFFFFFFFF D = C C = rotate_left(B, 9) B = A A = TT1 H = G G = rotate_left(F, 19) F = E E = P_0(TT2) A = A & 0xFFFFFFFF B = B & 0xFFFFFFFF C = C & 0xFFFFFFFF D = D & 0xFFFFFFFF E = E & 0xFFFFFFFF F = F & 0xFFFFFFFF G = G & 0xFFFFFFFF H = H & 0xFFFFFFFF V_i_1 = [] V_i_1.append(A ^ V_i[0]) V_i_1.append(B ^ V_i[1]) V_i_1.append(C ^ V_i[2]) V_i_1.append(D ^ V_i[3]) V_i_1.append(E ^ V_i[4]) V_i_1.append(F ^ V_i[5]) V_i_1.append(G ^ V_i[6]) V_i_1.append(H ^ V_i[7]) return V_i_1 def hash_msg(msg): # print(msg) len1 = len(msg) reserve1 = len1 % 64 msg.append(0x80) reserve1 = reserve1 + 1 # 56-64, add 64 byte range_end = 56 if reserve1 > range_end: range_end = range_end + 64 for i in range(reserve1, range_end): msg.append(0x00) bit_length = (len1) * 8 bit_length_str = [bit_length % 0x100] for i in range(7): bit_length = int(bit_length / 0x100) bit_length_str.append(bit_length % 0x100) for i in range(8): msg.append(bit_length_str[7 - i]) # print(msg) group_count = round(len(msg) / 64) B = [] for i in range(0, group_count): B.append(msg[i * 64:(i + 1) * 64]) V = [] V.append(IV) for i in range(0, group_count): V.append(CF(V[i], B[i])) y = V[i + 1] result = "" for i in y: result = '%s%08x' % (result, i) return result def str2byte(msg): # 字符串转换成byte数组 ml = len(msg) msg_byte = [] msg_bytearray = msg # 如果加密对象是字符串,则在此对msg做encode()编码即可,否则不编码 for i in range(ml): msg_byte.append(msg_bytearray[i]) return msg_byte def byte2str(msg): # byte数组转字符串 ml = len(msg) str1 = b"" for i in range(ml): str1 += b'%c' % msg[i] return str1.decode('utf-8') def hex2byte(msg): # 16进制字符串转换成byte数组 ml = len(msg) if ml % 2 != 0: msg = '0' + msg ml = int(len(msg) / 2) msg_byte = [] for i in range(ml): msg_byte.append(int(msg[i * 2:i * 2 + 2], 16)) return msg_byte def byte2hex(msg): # byte数组转换成16进制字符串 ml = len(msg) hexstr = "" for i in range(ml): hexstr = hexstr + ('%02x' % msg[i]) return hexstr def KDF(Z, klen): # Z为16进制表示的比特串(str),klen为密钥长度(单位byte) klen = int(klen) ct = 0x00000001 rcnt = ceil(klen / 32) Zin = hex2byte(Z) Ha = "" for i in range(int(rcnt)): msg = Zin + hex2byte('%08x' % ct) # print(msg) Ha = Ha + hash_msg(msg) # print(Ha) ct += 1 return Ha[0: klen * 2] def sm3_hash(msg, Hexstr=0): """ 封装方法,外部调用 :param msg: 二进制流(如若需要传入字符串,则把str2byte方法里msg做encode()编码一下,否则不编码) :param Hexstr: 0 :return: 64位SM3加密结果 """ if (Hexstr): msg_byte = hex2byte(msg) else: msg_byte = str2byte(msg) return hash_msg(msg_byte) if __name__ == '__main__': print(sm3_hash(b'SM3Test'))# 打印结果:901053b4681483b737dd2dd9f9a7f56805aa1b03337f8c1abb763a96776b8905
以上就是Python 实现国产SM3加密算法的示例代码的详细内容,更多关于Python 实现国产SM3加密算法的资料请关注其它相关文章!
圆月山庄资源网 Design By www.vgjia.com
广告合作:本站广告合作请联系QQ:858582 申请时备注:广告合作(否则不回)
免责声明:本站文章均来自网站采集或用户投稿,网站不提供任何软件下载或自行开发的软件! 如有用户或公司发现本站内容信息存在侵权行为,请邮件告知! 858582#qq.com
免责声明:本站文章均来自网站采集或用户投稿,网站不提供任何软件下载或自行开发的软件! 如有用户或公司发现本站内容信息存在侵权行为,请邮件告知! 858582#qq.com
圆月山庄资源网 Design By www.vgjia.com
暂无评论...
RTX 5090要首发 性能要翻倍!三星展示GDDR7显存
三星在GTC上展示了专为下一代游戏GPU设计的GDDR7内存。
首次推出的GDDR7内存模块密度为16GB,每个模块容量为2GB。其速度预设为32 Gbps(PAM3),但也可以降至28 Gbps,以提高产量和初始阶段的整体性能和成本效益。
据三星表示,GDDR7内存的能效将提高20%,同时工作电压仅为1.1V,低于标准的1.2V。通过采用更新的封装材料和优化的电路设计,使得在高速运行时的发热量降低,GDDR7的热阻比GDDR6降低了70%。
更新日志
2024年11月02日
2024年11月02日
- 《暗喻幻想》顺风耳作用介绍
- 崔健1985-梦中的倾诉[再版][WAV+CUE]
- 黄子馨《追星Xin的恋人们2》HQ头版限量编号[WAV+CUE]
- 孟庭苇《情人的眼泪》开盘母带[低速原抓WAV+CUE]
- 孙露《谁为我停留HQCD》[低速原抓WAV+CUE][1.1G]
- 孙悦《时光音乐会》纯银CD[低速原抓WAV+CUE][1.1G]
- 任然《渐晚》[FLAC/分轨][72.32MB]
- 英雄联盟新英雄安蓓萨上线了吗 新英雄安蓓萨技能介绍
- 魔兽世界奥杜尔竞速赛什么时候开启 奥杜尔竞速赛开启时间介绍
- 无畏契约CGRS准星代码多少 CGRS准星代码分享一览
- 张靓颖.2012-倾听【少城时代】【WAV+CUE】
- 游鸿明.1999-五月的雪【大宇国际】【WAV+CUE】
- 曹方.2005-遇见我【钛友文化】【WAV+CUE】
- Unity6引擎上线:稳定性提升、CPU性能最高提升4倍
- 人皇Sky今日举行婚礼!电竞传奇步入新篇章