Question

cryptography simple example
sums​

Answer 1

Answer:

A very simple example of RSA encryption

Select primes p=11, q=3.

n = pq = 11.3 = 33. phi = (p-1)(q-1) = 10.2 = 20.

Choose e=3. Check gcd(e, p-1) = gcd(3, 10) = 1 (i.e. 3 and 10 have no common factors except 1), ...

Compute d such that ed ≡ 1 (mod phi) i.e. compute d = (1/e) mod phi = (1/3) mod 20. ...

Public key = (n, e) = (33, 3)