在網上找了2種，一種加密原文中文結果會不一樣，并且不能大于等于64個字符，另一種可以中文但是也不可以大于等于64個字符，問題在哪里
方法1
import struct
import binascii
import hashlib
# 64個常數K
_K = (0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2)
# 初始化快取
_H = (0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,
0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19)
# 定義sha1_256類
class sha_256:
# 輸入引數為明文
def __init__(self, m=None):
# 初始化明文
self.buffer = b''
# 輸入明文長度
self.counter = 0
self.H = _H
self.K = _K
if m:
self.update(m)
# 定義回圈右移方法
def rotr(self, x, y):
return ((x >> y) | (x << (32 - y))) & 0xFFFFFFFF
# 定義對單個分組進行操作的方法
def operate(self, c):
# 定義長度為64的空串列w
w = [0] * 64
# 將單個分組轉換為16個32位的字，并填充w串列的前16位
w[0:16] = struct.unpack('!16L', c)
# 填充w串列的后48位
for i in range(16, 64):
s0 = self.rotr(w[i - 15], 7) ^ self.rotr(w[i - 15], 18) ^ (w[i - 15] >> 3)
s1 = self.rotr(w[i - 2], 17) ^ self.rotr(w[i - 2], 19) ^ (w[i - 2] >> 10)
w[i] = (w[i - 16] + s0 + w[i - 7] + s1) & 0xFFFFFFFF
a, b, c, d, e, f, g, h = self.H
# 執行64步迭代操作
for i in range(64):
s0 = self.rotr(a, 2) ^ self.rotr(a, 13) ^ self.rotr(a, 22)
maj = (a & b) ^ (a & c) ^ (b & c)
t2 = s0 + maj
s1 = self.rotr(e, 6) ^ self.rotr(e, 11) ^ self.rotr(e, 25)
ch = (e & f) ^ ((~e) & g)
t1 = h + s1 + ch + self.K[i] + w[i]
h = g
g = f
f = e
e = (d + t1) & 0xFFFFFFFF
d = c
c = b
b = a
a = (t1 + t2) & 0xFFFFFFFF
# 更新快取
self.H = [(x + y) & 0xFFFFFFFF for x, y in zip(self.H, [a, b, c, d, e, f, g, h])]
# 定義更新N個分組快取的方法
def update(self, m):
if not m:
return
# 獲取明文
self.buffer = m
# 獲取明文長度
self.counter = len(m)
# 計算明文長度表示的后64位
length = struct.pack('!Q', int(self.counter * 8))
# 對前N-1個分組進行哈希程序
while len(self.buffer) >= 64:
self._operate(self.buffer[:64])
self.buffer = self.buffer[64:]
# 填充未處理的第N個分組到512位或1024位，并進行哈希程序
mdi = self.counter % 64
# 如果第N個分組小于56，則填充至512位
if mdi < 56:
padlen = 55 - mdi
self.buffer += (b'\x80' + (b'\x00' * padlen) + length)
self.operate(self.buffer)
# 否則，填充到1024位
else:
padlen = 119 - mdi
self.buffer += (b'\x80' + (b'\x00' * padlen) + length)
for i in range(2):
self.operate(self.buffer[i * 64:(i + 1) * 64])
# 輸出明文摘要， 位元組串型別
def digest(self):
return struct.pack('!8L', *self.H)
# 輸出明文搞要， 十六進制字串型別
def hexdigest(self):
return binascii.hexlify(self.digest()).decode()
saz=input('請輸入需要加密的字串')
if __name__ == "__main__":
print(sha_256((saz.encode('utf-8'))).digest()) #上邊演算法實作
print(hashlib.sha256((saz.encode('utf-8'))).digest()) #自帶hashlib庫實作
print(sha_256((saz.encode('utf-8'))).hexdigest()) #上邊演算法實作
print(hashlib.sha256((saz.encode('utf-8'))).hexdigest()) #自帶hashlib庫實作
方法2
import struct
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))
def rotate_right(a, k):
k = k % 32
return (((a >> k) & 0xFFFFFFFF) | ((a & 0xFFFFFFFF) << (32 - k))) & 0xFFFFFFFF
def rotate_shift(a,k):
k = k%32
return ((a >> k) & 0xFFFFFFFF);
def P_0(X):
return (rotate_right(X, 7)) ^ (rotate_right(X, 18)) ^ (rotate_shift(X,3))
def P_1(X):
return (rotate_right(X, 17)) ^ (rotate_right(X, 19)) ^ (rotate_shift(X,10))
IV="0x6A09E667 0xBB67AE85 0x3C6EF372 0xA54FF53A 0x510E527F 0x9B05688C 0x1F83D9AB 0x5BE0CD19"
IV=IV.replace("0x","")
IV=int(IV.replace(" ",""),16)
K = """0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 """
K=K.replace("\n","")
K=K.replace(", ","")
K=K.replace(" ","")
K=K.replace("0x","")
K=int(K,16)
a = []
for i in range(0, 8):
a.append(0)
a[i] = (IV >> ((7 - i) * 32)) & 0xFFFFFFFF
IV = a
k = []
for i in range(0,64):
k.append(0)
k[i]= (K >> ((63-i)*32)) & 0xFFFFFFFF
K = k
def CF(V_i, B_i):
W = []
for j in range(0, 16):
W.append(0)
unpack_list = struct.unpack(">I", B_i[j*4:(j+1)*4])
W[j] = unpack_list[0]
for j in range(16, 64):
W.append(0)
s0 = P_0(W[j-15])
s1 = P_1(W[j-2])
W[j] = (W[j-16] + s0 + W[j-7] + s1) & 0xFFFFFFFF
str1 = "%08x" % W[j]
W_1 = []
A, B, C, D, E, F, G, H = V_i
"""
print "00",
out_hex([A, B, C, D, E, F, G, H])
"""
"""
S1 := (e rightrotate 6) xor (e rightrotate 11) xor (e rightrotate 25)
ch := (e and f) xor ((not e) and g)
temp1 := h + S1 + ch + k[i] + w[i]
S0 := (a rightrotate 2) xor (a rightrotate 13) xor (a rightrotate 22)
maj := (a and b) xor (a and c) xor (b and c)
temp2 := S0 + maj
h := g
g := f
f := e
e := d + temp1
d := c
c := b
b := a
a := temp1 + temp2
T1 = H + LSigma_1(E) + Conditional(E, F, G) + K[i] + W[i];
T2 = LSigma_0(A) + Majority(A, B, C);
"""
for j in range(0, 64):
SS1 = rotate_right(E,6) ^ rotate_right(E,11) ^ rotate_right(E,25)
SS0 = rotate_right(A,2) ^ rotate_right(A,13) ^ rotate_right(A,22)
ch = (E & F) ^ ((~E) & G)
temp1 = (H + SS1 + ch + K[j] + W[j]) & 0xFFFFFFFF
maj = (A & B) ^ (A & C) ^ ( B & C)
temp2 = (SS0 + maj) & 0xFFFFFFFF
H = G
G = F
F = E
E = (D + temp1)
D = C
C = B
B = A
A = (temp1 + temp2)
A = A & 0xFFFFFFFF
B = B & 0xFFFFFFFF
C = C & 0xFFFFFFFF
D = D & 0xFFFFFFFF
E = E & 0xFFFFFFFF
F = F & 0xFFFFFFFF
G = G & 0xFFFFFFFF
H = H & 0xFFFFFFFF
"""
str1 = "%02d" % j
if str1[0] == "0":
str1 = ' ' + str1[1:]
print str1,
out_hex([A, B, C, D, E, F, G, H])
"""
V_i_1 = []
V_i_1.append((A + V_i[0]) & 0xFFFFFFFF)
V_i_1.append((B + V_i[1]) & 0xFFFFFFFF)
V_i_1.append((C + V_i[2]) & 0xFFFFFFFF)
V_i_1.append((D + V_i[3]) & 0xFFFFFFFF)
V_i_1.append((E + V_i[4]) & 0xFFFFFFFF)
V_i_1.append((F + V_i[5]) & 0xFFFFFFFF)
V_i_1.append((G + V_i[6]) & 0xFFFFFFFF)
V_i_1.append((H + V_i[7]) & 0xFFFFFFFF)
return V_i_1
def hash_msg(msg):
len1 = len(msg)
reserve1 = len1 % 64
msg1 = msg.encode() + struct.pack("B",128)
reserve1 = reserve1 + 1
for i in range(reserve1, 56):
msg1 = msg1 + struct.pack("B",0)
bit_length = (len1) * 8
bit_length_string = struct.pack(">Q", bit_length)
msg1 = msg1 + bit_length_string
print (len(msg1) )
group_count = int(len(msg1) / 64 )
print(group_count)
m_1 = B = []
for i in range(0, group_count):
B.append(0)
B[i] = msg1[i*64:(i+1)*64]
V = []
V.append(0)
V[0] = IV
for i in range(0, group_count):
V.append(0)
V[i+1] = CF(V[i], B[i])
return V[i+1]
saz=input('請輸入需要加密的字串')
print (saz)
sazu8=((saz).encode()) #轉換編碼 默認.encode('utf-8')
print(sazu8)
print ("\n")
y = hash_msg(saz) #此演算法中文結果會不一樣
print ("result: ")
print(out_hex(y))
import hashlib
sh = hashlib.sha256()
saz_sha = hashlib.sha256(sazu8).hexdigest()
print(saz_sha)
uj5u.com熱心網友回復：
import hashlib
m = hashlib.sha256()
m.update(b"Nobody inspects")
m.digest()
uj5u.com熱心網友回復：
這是自帶庫的用法，這個我知道，我就想知道上邊實作的演算法為啥原文不能超過63個字符，自帶的庫就可以
uj5u.com熱心網友回復：
你要研究代碼也去研究好的代碼，不好的代碼何必管它呢轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/34905.html
下一篇：python小白求助！！！！！