Статья Автор: Лебедев Дмитрий Алексеевич

Моделируем шифрование RSA с помощью SymPy

import sympy as sp
from time import process_time as prt
A, B, e = 2**60, 2**65, 2**16+1
p = sp.Integer(sp.randprime(A, B))
q = sp.Integer(sp.randprime(A, B))
n = p * q
#phi_n = (p-1)*(q-1)
t0 = prt()
phi_nt = sp.totient(p*q)
phi_n = phi_nt
d = sp.mod_inverse(e,n)
print(f'time = {prt() - t0}')
print(p,q,n,phi_n, sp.gcd(e,phi_n),phi_nt,d,sep ='\n')

from sympy import *
init_printing(use_latex=True)
expression = (sqrt(13)+sqrt(7))**2/(10+sqrt(91))
x = Symbol('x_1')
expr1 = x**100
#display(x**100)
expr1

∫𝑥𝑥𝑑𝑥

Печать