RSA
Alice has two large (150+ digit) prime numbers: pA , qA .
She then computes:
nA = pA * qA and mA = Φ(nA) = (pA-1)(qA-1)
Then she finds a number eA such that gcd (eA, mA) = 1.
And computes dA such that dA * eA = 1 (mod mA).
She then publishes nA and eA as her public keys, destroying all copies of pA, qA and mA, keeping dA a secret.
A “
(
Read more... )