文章目錄
效果
代碼
from encryption_algorithm import Euclid
import random
class ECC:
def __init__(self, coe: list, p: int, G: list):
self.coe = coe
self.p = p
self.G = G
# 普通加法
def add(self, a: list ,b: list)-> list:
euc = Euclid.euclid()
a_x, a_y = a[0], a[1]
b_x, b_y = b[0], b[1]
# 兩橫坐標不等
if(a_x!=b_x):
#print(p, b_x-a_x)
c = (b_y - a_y) * euc.get_valid_X_Y(self.p, (b_x-a_x)%self.p, ret_String=False)[1]
c %= p
# 兩橫坐標相等，但縱坐標不為相反數
elif((a_y+b_y)%p!=0):
c = (3 * a_x**2 + self.coe[0]) * euc.get_valid_X_Y(self.p, (2*a_y)%self.p, ret_String=False)[1]
c %= self.p
# 橫坐標相等，縱坐標為相反數時，不能計算
else:
return None
x = (c**2 - a_x - b_x) % self.p
y = (c*(a_x - x) - a_y) % self.p
return [x, y]
# 數量乘法
def mul(self, n: int, T: list)-> list:
res = T
while(n>1):
res = self.add(res, T)
if(res==None):
print("橫坐標相等, 縱坐標為相反數, 不可計算!!!")
return None
n -= 1
return res
if __name__=='__main__':
# 橢圓曲線參數
coe = [1, 1]
p = 23
# 循環群選擇
n = 27
G = [0, 1]
# 密鑰生成
dh_ecc = ECC(coe, p, G)
n_a = 5
n_b = 11
# 公鑰生成
mul_a = dh_ecc.mul(n_a,G)
mul_b = dh_ecc.mul(n_b,G)
# 共享密鑰計算
Share_a = dh_ecc.mul(n_a,mul_b)
Share_b = dh_ecc.mul(n_b,mul_a)
print('用戶a計算出的共享密鑰: {}'.format(Share_a))
print('用戶b計算出的共享密鑰: {}'.format(Share_b))
