Crypto笔记一、RSA的python实现。

一、已知p，q，e。求d（其实就是一个辗转相除法）

非递归实现实现。

import math
import os
def exgcd(m, n, x=0, y=0):
    if n == 0:
        x = 1
        y = 0
        return (m, x, y)
    a1 = b = 1
    a = b1 = 0
    c = m
    d = n
    q = int(c / d)
    r = c % d
    while r:
        c = d
        d = r
        t = a1
        a1 = a
        a = t - q * a
        t = b1
        b1 = b
        b = t - q * b
        q = int(c / d)
        r = c % d
    x = a
    y = b
    return x


def quick_algorithm(a, b, c):
    a = a % c
    ans = 1
    while b != 0:
        if b & 1:
            ans = (ans * a) % c
        b >>= 1
        a = (a * a) % c
    return ans

# 假设p，q是下面的数字
p=input('请输入p: ')
q=input('请输入q: ')

n = p * q

phi_n = (p-1) * (q-1)
# 因为e一般是65537，但是也可以指定符合要求的e值
e = 0x10001
d = 0
d = exgcd(e, phi_n)
if(d == 0):
    print("Can't generate a proper number d to fit the requirement.")
    os.system("pause")
if(d < 0 ):
    print("d is : "+ str(d))

递归实现

def ext_gcd(a, b):
    if b == 0:
        return 1, 0, a
    else:
        x, y, q = ext_gcd(b, a % b)
        x, y = y, (x - (a // b) * y)
        return x, y, q

#产生秘钥d
def generate_d(ph_n, e):
    (x, y, r) = ext_gcd(ph_n, e)
    # y maybe < 0, so convert it
    if y < 0:
        return y + ph_n  #直接用加法效率高一丢丢
    return y

#测试案例
ph_n=81737809617759683287793595646697619728822861439165953502768429214193321361662844576536161329827962282311899433873006534087326569174872580720699203527035157147342922477301766159312218643350845733965304535120140350054684545003833324519514858644165196052138927081872922079949238712120031621118786147258219027360
e=65537
print(generate_d(ph_n,e))