Kernel: SageMath (Development)
In [1]:
21
True
In [2]:
gcd(252, 105) = 21 = 252*-2 + 105*5
In [3]:
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
12
In [4]:
[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14]
[1, 2, 4, 7, 8, 11, 13, 14]
8
In [4]:
gcd(7, 13) = 1 = 7*2 + 13*-1
The inverse of 7 mod 13 is 2
In [11]:
p = 7, q = 2
N = 14
phiN = 6
public key e = 5
-1
private key d = 5
In [6]:
331
In [7]:
12
In [0]: