RSA费马攻击python实现

根据提供的引用内容，无法回答RSA费马攻击的Python实现。但是，可以为您提供RSA加密和解密的Python实现。

RSA加密和解密的Python实现如下所示：

import random

def gcd(a, b):
    while b != 0:
        a, b = b, a % b
    return a

def multiplicative_inverse(e, phi):
    d = 0
    x1 = 0
    x2 = 1
    y1 = 1
    temp_phi = phi
    
    while e > 0:
        temp1 = temp_phi//e
        temp2 = temp_phi - temp1 * e
        temp_phi = e
        e = temp2
        
        x = x2 - temp1 * x1
        y = d - temp1 * y1
        
        x2 = x1
        x1 = x
        d = y1
        y1 = y
    
    if temp_phi == 1:
        return d + phi

def generate_keypair(p, q):
    if not (is_prime(p) and is_prime(q)):
        raise ValueError("Both numbers must be prime.")
    elif p == q:
        raise ValueError("p and q cannot be equal")
    
    n = p * q
    phi = (p-1) * (q-1)
    
    e = random.randrange(1, phi)
    g = gcd(e, phi)
    while g != 1:
        e = random.randrange(1, phi)
        g = gcd(e, phi)
    
    d = multiplicative_inverse(e, phi)
    
    return ((n, e), (n, d))

def encrypt(pk, plaintext):
    key, n = pk
    cipher = [pow(ord(char), key, n) for char in plaintext]
    return cipher

def decrypt(pk, ciphertext):
    key, n = pk
    plain = [chr(pow(char, key, n)) for char in ciphertext]
    return ''.join(plain)

def is_prime(num):
    if num == 1:
        return False
    elif num == 2:
        return True
    elif num > 2 and num % 2 == 0:
        return False
    else:
        for i in range(3, int(num**0.5)+1, 2):
            if num % i == 0:
                return False
        return True

# 生成公钥和私钥
p = 61
q = 53
public, private = generate_keypair(p, q)
print("公钥:", public)
print("私钥:", private)

# 加密
message = 'Hello World'
encrypted_msg = encrypt(public, message)
print("加密后的消息:", ''.join(map(lambda x: str(x), encrypted_msg)))

# 解密
decrypted_msg = decrypt(private, encrypted_msg)
print("解密后的消息:", decrypted_msg)
print("解密是否正确:", message == decrypted_msg)