使用Python中的pow函数进行加密和解密操作

import random

# 生成一个随机质数
def generate_prime():
    while True:
        n = random.randint(100, 1000)
        if is_prime(n):
            return n

# 判断一个数是否是质数
def is_prime(n):
    if n <= 1:
        return False
    for i in range(2, int(n**0.5)+1):
        if n % i == 0:
            return False
    return True

# 计算模数、公钥和私钥
p = generate_prime()
q = generate_prime()
n = p * q
phi = (p-1) * (q-1)
e = 65537
d = pow(e, -1, phi)

# 加密和解密函数
def encrypt(message):
    m = int.from_bytes(message.encode(), 'big')
    c = pow(m, e, n)
    return c

def decrypt(ciphertext):
    m = pow(ciphertext, d, n)
    message = m.to_bytes((m.bit_length() + 7) // 8, 'big').decode()
    return message

# 加密和解密示例
plaintext = "pidancode.com"
ciphertext = encrypt(plaintext)
decrypted = decrypt(ciphertext)
print("加密后的密文：", ciphertext)
print("解密后的明文：", decrypted)