ECC-加法同态

#椭圆曲线y^2=x^3+ax+b参数
MOD=79
def getR(p, q,mod=MOD, a=2):
   p = list(map(lambda x: x % mod, p))
   q = list(map(lambda x: x % mod, q))
   #print("p,q")
   #print(p,q)
   if p!= q:
       c = (p[1]-q[1])*invert(p[0]-q[0], mod)%mod
   else:
       c = (3*p[0]**2+a)*invert(2*p[1],mod)%mod
   rx = (c**2-p[0]-q[0])%mod
   ry = (c*(p[0]-rx)-p[1])%mod
   return [rx,ry]
   
def add(G, multiple):
   lr = G
   for index in range(1, multiple):
       lr = getR(lr, G)
   return lr

def invert(element, mod):
   if element >= mod:
       element = element%mod
   if element == 0:
       return None
   for index in range(1, mod):
       if element*index%mod == 1:
           return index
def ECCInit():
    G = (1,18)
    prikey = 40
    #公开密钥K = kG
    pubkey = add(G,prikey)
    return G,pubkey,prikey
def ECCEncryption(M,G,pubkey,r):
    #C1 = M+rK
    C1 = getR(M,add(pubkey,r))
    #C2 = rG
    C2 = add(G, r)
    return C1,C2
def ECCDecryption(C1,C2,MOD,prikey):
    temp = add(C2,prikey)
    return getR(C1,(temp[0], MOD-temp[1]))
def main():
    G,pubkey,prikey = ECCInit()
    print("G=",G)
    print("pubkey=",pubkey)
    
    M1= [78,24]
    print("M1=",M1)
    r1=16
    C11,C12 = ECCEncryption(M1,G,pubkey,r1)
    print("C1=",(C11,C12))
    M2= [96,27]
    print("M2=",M2)
    r2=17
    C21,C22 = ECCEncryption(M2,G,pubkey,r2)
    print("C2",(C21,C22))
    M3=[(M1[0]+M2[0])%79,(M1[1]+M2[1])%79]
    print("M3=M1+M2=",M3)

    C31=[C11[0]+C21[0],C11[1]+C21[1]]
    C32=[C12[0]+C22[0],C12[1]+C22[1]]

    C31,C32 = ECCEncryption(M3,G,pubkey,r1+r2)
    print("C3=",(C31,C32))
    #解密c3
    print("Decrypt(c3)=",end="")
    print(ECCDecryption(C31,C32,MOD,prikey))
    if(M3==ECCDecryption(C31,C32,MOD,prikey)):
        print("M3=M1+M2==ECCDecryption(C31,C32,MOD,prikey)")
if __name__ == '__main__':
    main()

运行结果如下：