rsa-crt算法带Square­Mult和测试案例的高效率py语言实现代码

下面是 RSA-CRT 算法的 Python 代码，使用了 Square-Mult 和快速幂算法，以及一些测试用例：

# RSA-CRT algorithm with Square-Mult and fast power in Python

# Fast power algorithm
def fast_power(base, power, mod):
    result = 1
    while power > 0:
        if power % 2 == 1:
            result = (result * base) % mod
        base = (base * base) % mod
        power = power // 2
    return result

# Square-Mult algorithm
def square_mult(base, power, mod):
    result = 1
    while power > 0:
        if power % 2 == 1:
            result = (result * base) % mod
        base = (base * base) % mod
        power = power // 2
    return result

# RSA-CRT algorithm
def rsa_crt(m, d, p, q):
    # Compute dP and dQ
    dP = d % (p - 1)
    dQ = d % (q - 1)
    # Compute qInv
    qInv = fast_power(q, p - 2, p)
    # Compute m1 and m2
    m1 = square_mult(m, dP, p)
    m2 = square_mult(m, dQ, q)
    # Compute h
    h = (qInv * (m1 + p - m2)) % p
    # Compute the result
    result = m2 + h * q
    return result

# Test the RSA-CRT algorithm
m = 123456789
d = 6543210987654321
p = 1048583
q = 1048591
print(rsa_crt(m, d, p, q))

希望这些代码能帮到你。