rsa

#!/usr/bin/env python3

def coprime(a, b):
    from math import gcd
    return gcd(a, b) == 1


q = 79
p = 131
n = p * q  # n = 10349
F = (p - 1) * (q - 1)  # F = 10140
print(n)
print(F)

d = 8
while d < F:
    if coprime(d, F):
        break
    d += 1
print(d)  # d = 11

e = 1
while True:
    if (d * e) % F == 1:
        break
    e += 1
print(e)  # e = 5531

M = [25, 13, 1]
C = list()

for i in M:
    C.append(pow(i, e) % n)

print(C)  # 248, 4306, 1
print([pow(C[0], d) % n, pow(C[1], d) % n, pow(C[2], d) % n])