Python2.7实现Paillier算法+验证加法同态性质

最新推荐文章于 2024-04-22 15:30:21 发布

zlynchw

最新推荐文章于 2024-04-22 15:30:21 发布

阅读量184

点赞数 4

文章标签： python conda

本文链接：https://blog.csdn.net/zlynchw/article/details/137214847

版权

from __future__ import print_function # 解决python2 print()出现其他字符的问题
import gmpy2
import time


# generate prime number 生成素数
def __generate_prime__(rs):
    p = gmpy2.mpz_urandomb(rs, 1024)
    while not gmpy2.is_prime(p):
        p += 1
    return p


# generate L(x)
def __el__(x, n):
    fx = gmpy2.c_div((x - 1), n)
    return int(fx)


# key generation 生成公私钥对
def keygen():
    while True:
        random_state = gmpy2.random_state(int(time.time()))
        p = __generate_prime__(random_state)
        q = __generate_prime__(random_state)
        if gmpy2.gcd((p * q), ((p - 1) * (q - 1))) == 1:
            break
    n = p * q
    lmd = gmpy2.lcm((p - 1), (q - 1))
    random_state = gmpy2.random_state(int(time.time()))
    g = gmpy2.mpz_random(random_state, n ** 2)
    x = gmpy2.powmod(g, lmd, n ** 2)
    el1 = __el__(x, n)
    mu = gmpy2.powmod(el1, (-1), n)
    return (n, g), (lmd, mu, n)


# encryption of plaintext 加密
def encrypt(plaintext, public_key):
    m = int(plaintext)
    n, g = public_key
    random_state = gmpy2.random_state(int(time.time()))
    r = gmpy2.mpz_random(random_state, n)
    c = gmpy2.powmod(g, m, n ** 2) * gmpy2.powmod(r, n, n ** 2)
    return c


# decryption of ciphertext 解密
def decrypt(ciphertext, private_key):
    c = ciphertext
    lmd, mu, n = private_key
    x = gmpy2.powmod(c, lmd, n ** 2)
    el2 = __el__(x, n)
    result = gmpy2.mod((el2 * mu), n)
    return result


# main
if __name__ == "__main__":
    public_key1, private_key1 = keygen() # 生成公私钥对
    plaintext1 = input("Enter first number:")
    plaintext2 = input("Enter second number:")
    ciphertext1 = encrypt(plaintext1, public_key1)
    ciphertext2 = encrypt(plaintext2, public_key1)
    result1 = ciphertext1 * ciphertext2 # 密文相乘
    result2 = decrypt(result1, private_key1) # 新密文解密得出的新明文应为输入的明文的相加
    print("Ciphertext of first number:", ciphertext1.digits())
    print("Ciphertext of second number:", ciphertext2.digits())
    print("New Ciphertext:", result1.digits())
    print("New Plaintext:", result2.digits())